AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY
From MaRDI portal
Publication:5483379
DOI10.1142/S0129054106004042zbMath1096.68162MaRDI QIDQ5483379
Publication date: 14 August 2006
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
analysis of algorithms; graph connectivity; distributed algorithms; network reliability; 3-edge-connected component; cut-pair
68W40: Analysis of algorithms
68M10: Network design and communication in computer systems
05C85: Graph algorithms (graph-theoretic aspects)
05C40: Connectivity
68W15: Distributed algorithms
Cites Work
- An efficient distributed algorithm for centering a spanning tree of a biconnected graph
- A general program scheme for finding bridges
- A linear time algorithm for computing 3-edge-connected components in a multigraph
- An incremental distributed algorithm for computing biconnected components in dynamic graphs
- Some remarks on distributed depth-first search.
- Depth-First Search and Linear Graph Algorithms