An efficient distributed bridge-finding algorithm

DOI10.1016/0020-0255(94)90090-6zbMath0837.68042OpenAlexW1974518651MaRDI QIDQ1894245

Pranay Chaudhuri

Publication date: 10 August 1995

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(94)90090-6

zbMATH Keywords

connected undirected graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (2)

An efficient distributed algorithm for finding all hinge vertices in networks ⋮ A self-stabilizing algorithm for detecting fundamental cycles in a graph

Cites Work

• Unnamed Item
• Algorithms for some graph problems on a distributed computational model
• A new distributed depth-first-search algorithm
• Termination detection for diffusing computations
• Distributed processing of graphs: Fundamental cycles algorithm
• Corrigenda: Corrections to a distributed depth-first search algorithm
• A note on finding the bridges of a graph
• Distributed algorithms for finding centers and medians in networks
• Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
• Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation
• An Efficient Parallel Biconnectivity Algorithm
• Fast, Efficient Parallel Algorithms for Some Graph Problems
• A Distributed Graph Algorithm: Knot Detection

This page was built for publication: An efficient distributed bridge-finding algorithm