An Optimal Distributed Algorithm for Computing Bridge-Connected

@article{Chaudhuri1997AnOD,
  title={An Optimal Distributed Algorithm for Computing Bridge-Connected},
  author={P. Chaudhuri},
  journal={Comput. J.},
  year={1997},
  volume={40},
  pages={200-207}
}
  • P. Chaudhuri
  • Published 1997
  • Computer Science
  • Comput. J.
  • In this paper I present a distributed algorithm that finds the bridge-connected components of a connected undirected graph. The algorithm uses O(n) messages and O(n) units of time, where n is the number of nodes in the graph. It is shown that the algorithm is optimal in communication complexity to within a constant factor. 
    14 Citations
    An Efficient Distributed Algorithm for 3-edge-connectivity
    • 10
    An Optimal Distributed Edge-Biconnectivity Algorithm
    • 2
    • Highly Influenced
    • PDF
    An $O(n^2)$ Self-Stabilizing Algorithm for Computing Bridge-Connected Components
    • 42
    An Energy-Efficient Distributed Cut Vertex Detection Algorithm for Wireless Sensor Networks
    • 13
    • Highly Influenced
    • PDF
    Robust network computation
    • 9
    • PDF
    Employing Cooperative Communication to Recover Network Connectivity in Ad Hoc Networks
    • 2
    • PDF
    Energy-Efficient Bridge Detection Algorithms for Wireless Sensor Networks
    • 6
    Breadth-First Search-Based Single-Phase Algorithms for Bridge Detection in Wireless Sensor Networks
    • 13

    References

    SHOWING 1-10 OF 19 REFERENCES
    Distributed processing of graphs: Fundamental cycles algorithm
    • 4
    A New Distributed Depth-First-Search Algorithm
    • 155
    • PDF
    Parallel algorithms for connectivity problems in graph theory
    • 6
    Algorithms for some graph problems on a distributed computational model
    • 11
    A Distributed Graph Algorithm: Knot Detection
    • 69
    • PDF
    Fast, Efficient Parallel Algorithms for Some Graph Problems
    • 118
    Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
    • 80
    • PDF
    Echo Algorithms: Depth Parallel Operations on General Graphs
    • E. J. Chang
    • Computer Science
    • IEEE Transactions on Software Engineering
    • 1982
    • 277
    • PDF
    Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation
    • 31
    Distributed algorithms for finding centers and medians in networks
    • 94