Distributed algorithms for finding centers and medians in networks
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient parallel algorithms for a class of graph theoretic problems
SIAM Journal on Computing
An efficient distributed depth-first-search algorithm
Information Processing Letters
Parallel algorithms: design and analysis
Parallel algorithms: design and analysis
Distributed processing of graphs: fundamental cycles algorithm
Information Sciences: an International Journal
An efficient distributed bridge-finding algorithm
Information Sciences—Informatics and Computer Science: An International Journal
A Distributed Graph Algorithm: Knot Detection
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed computation on graphs: shortest path algorithms
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
Echo Algorithms: Depth Parallel Operations on General Graphs
IEEE Transactions on Software Engineering
Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation
IEEE Transactions on Software Engineering
Finding Biconnected Componemts And Computing Tree Functions In Logarithmic Parallel Time
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Network Stability Assessment Using the Number of Tree Adjacent to an Articulation Node
ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
Topological-order based dynamic polling scheme using routing path for network monitoring
HSI'03 Proceedings of the 2nd international conference on Human.society@internet
| Hi-index | 0.24 |
This paper presents a distributed algorithm for finding the articulation points in an n node communication network represented by a connected undirected graph. For a given graph if the deletion of a node splits the graph into two or more components then that node is called an articulation point. The output of the algorithm is available in a distributed manner, i.e., when the algorithm terminates each node knows whether it is an articulation point or not. It is shown that the algorithm requires O(n) messages and O(n) units of time and is optimal in communication complexity to within a constant factor.