AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY

DOI10.1142/S0129054106004042zbMath1096.68162MaRDI QIDQ5483379

Yung Hyang Tsin

Publication date: 14 August 2006

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

analysis of algorithmsgraph connectivitydistributed algorithmsnetwork reliability3-edge-connected componentcut-pair

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Network design and communication in computer systems (68M10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Distributed algorithms (68W15)

Related Items (1)

SELF-STABILIZING COMPUTATION OF 3-EDGE-CONNECTED COMPONENTS

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

This page was built for publication: AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY