A simple 3-edge-connected component algorithm

DOI10.1007/s00224-005-1269-4zbMath1107.68069OpenAlexW2068006581MaRDI QIDQ866918

Yung Hyang Tsin

Publication date: 14 February 2007

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-005-1269-4

zbMATH Keywords

undirected graph

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (10)

ALGEBRAIC STRUCTURES RELATED TO BALANCED FUNCTIONS ON GRAPHS: RESULTS AND OPEN PROBLEMS ⋮ Maximum-cover source location problems with objective edge-connectivity three ⋮ ON FINDING SPARSE THREE-EDGE-CONNECTED AND THREE-VERTEX-CONNECTED SPANNING SUBGRAPHS ⋮ A simple certifying algorithm for 3-edge-connectivity ⋮ Algorithms for placing monitors in a flow network ⋮ Certifying 3-edge-connectivity ⋮ Yet another optimal algorithm for 3-edge-connectivity ⋮ Algorithms for Placing Monitors in a Flow Network ⋮ The Common Structure of the Curves Having a Same Gauss Word ⋮ A simple 3-edge connected component algorithm revisited

This page was built for publication: A simple 3-edge-connected component algorithm