Yet another optimal algorithm for 3-edge-connectivity

DOI10.1016/j.jda.2008.04.003zbMath1168.68613OpenAlexW1985142908MaRDI QIDQ1013081

Yung Hyang Tsin

Publication date: 16 April 2009

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2008.04.003

zbMATH Keywords

analysis of algorithmsgraph connectivitydepth-first searchedge-connectivity3-edge-connected graph3-edge-connected componentcut-pair

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

ON FINDING SPARSE THREE-EDGE-CONNECTED AND THREE-VERTEX-CONNECTED SPANNING SUBGRAPHS ⋮ Groups of balanced labelings on graphs ⋮ A simple certifying algorithm for 3-edge-connectivity ⋮ Unnamed Item ⋮ Certifying 3-edge-connectivity ⋮ A simple 3-edge connected component algorithm revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Path-based depth-first search for strong and biconnected components
• A general program scheme for finding bridges
• Improved algorithms for graph four-connectivity
• A simple 3-edge-connected component algorithm
• A linear time algorithm for computing 3-edge-connected components in a multigraph
• A note on finding the bridges of a graph
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Yet another optimal algorithm for 3-edge-connectivity