On maximal 3-edge-connected subgraphs of undirected graphs.

Loukas Georgiadis Giuseppe F. Italiano Evangelos Kosinas Debasish Pattanayak

Published in: CoRR (2022)

Keyphrases

undirected graph
connected subgraphs
directed acyclic graph
connected components
disjoint paths
directed graph
complex networks
approximation algorithms
biological networks
spanning tree
binary images
graph structure
random variables
vertex set
minimum cost
strongly connected