AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY
DOI10.1142/S0129054106004042zbMATH Open1096.68162MaRDI QIDQ5483379FDOQ5483379
Publication date: 14 August 2006
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
analysis of algorithmsdistributed algorithmsgraph connectivitynetwork reliability3-edge-connected componentcut-pair
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40) Connectivity (05C40) Distributed algorithms (68W15) Network design and communication in computer systems (68M10)
Cites Work
- Depth-First Search and Linear Graph Algorithms
- A linear time algorithm for computing 3-edge-connected components in a multigraph
- Some remarks on distributed depth-first search.
- An efficient distributed algorithm for centering a spanning tree of a biconnected graph
- A general program scheme for finding bridges
- An incremental distributed algorithm for computing biconnected components in dynamic graphs
Cited In (4)
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- A linear time algorithm for computing 3-edge-connected components in a multigraph 👍 👎
- Yet another optimal algorithm for 3-edge-connectivity 👍 👎
- Distributed algorithms for edge dominating sets 👍 👎
- A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity 👍 👎
- Distributed edge connectivity in sublinear time 👍 👎
- A simple certifying algorithm for 3-edge-connectivity 👍 👎
- Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs 👍 👎
This page was built for publication: AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5483379)
