论文信息 - An Efficient Distributed Algorithm for Finding Articulation Points, Bridges, and Biconnected Components in Asynchronous Networks - 字舞流文

An Efficient Distributed Algorithm for Finding Articulation Points, Bridges, and Biconnected Components in Asynchronous Networks

Yahui Zhu | Mohan Ahuja | Yahui Zhu | Mohan L. Ahuja

[1] Ernest J. H. Chang,et al. Echo Algorithms: Depth Parallel Operations on General Graphs , 1982, IEEE Transactions on Software Engineering.

[2] Baruch Awerbuch,et al. A New Distributed Depth-First-Search Algorithm , 1985, Inf. Process. Lett..

[3] Yung H. Tsin,et al. Efficient Parallel Algorithms for a Class of Graph Theoretic Problems , 1984, SIAM J. Comput..

[4] Joseph JáJá,et al. Fast, Efficient Parallel Algorithms for Some Graph Problems , 1981, SIAM J. Comput..

[5] Robert E. Tarjan,et al. A Note on Finding the Bridges of a Graph , 1974, Inf. Process. Lett..

[6] Israel Cidon. Yet Another Distributed Depth-First-Search Algorithm , 1988, Inf. Process. Lett..

[7] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[8] Ellis Horowitz,et al. Fundamentals of Computer Algorithms , 1978 .

[9] Krishnaiyan Thulasiraman,et al. A Time-Optimal Message-Efficient Distributed Algorithm for Depth-First-Search , 1987, Inf. Process. Lett..

[10] Francis Y. L. Chin,et al. A General Program Scheme for Finding Bridges , 1983, Inf. Process. Lett..

[11] Robert E. Tarjan,et al. An Efficient Parallel Biconnectivity Algorithm , 2011, SIAM J. Comput..