Distributed Algorithms for Network Recognition Problems

The problem of recognizing whether a given network is a tree, ring, star, complete graph, or bipartite graph is considered. Unified algorithms to recognize if the network is any one of the above are presented in each of three classes of algorithms-with centralized, decentralized, and noncentralized initiations. It is shown that the communication and time complexities of the centralized algorithm are linear in e and d, respectively, while those for decentralized algorithm are O(e+n log n) and O(n), respectively (e is the number of edges, n is the number of processors, and d is the diameter of the graph). The complexities for noncentralized algorithms are, respectively O(e+n log k), where k is the level number, and O(n). >

[1]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[2]  Baruch Awerbuch,et al.  Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems , 1987, STOC.

[3]  Jayadev Misra,et al.  Detecting termination of distributed computations using markers , 1983, PODC '83.

[4]  K. Mani Chandy,et al.  A Distributed Graph Algorithm: Knot Detection , 1982, TOPL.

[5]  Gary L. Peterson,et al.  An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem , 1982, TOPL.

[6]  Baruch Awerbuch,et al.  Distributed BFS algorithms , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[7]  K. Mani Chandy,et al.  Distributed computation on graphs: shortest path algorithms , 1982, CACM.

[8]  Francis Y. L. Chin,et al.  An almost linear time and O(nlogn+e) Messages distributed algorithm for minimum-weight spanning trees , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[9]  Baruch Schieber,et al.  Slowing sequential algorithms for obtaining fast distributed and parallel algorithms: maximum matchings , 1986, PODC '86.

[10]  Greg N. Frederickson,et al.  A Single Source Shortest Path Algorithm for a Planar Distributed Network , 1985, STACS.

[11]  Nicola Santoro,et al.  Distributed algorithms for finding centers and medians in networks , 1984, TOPL.

[12]  To-Yat Cheung.  Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation , 1983, IEEE Trans. Software Eng..

[13]  Edsger W. Dijkstra,et al.  Termination Detection for Diffusing Computations , 1980, Inf. Process. Lett..

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

[15]  Keith Marzullo,et al.  Maintaining the time in a distributed system , 1985, OPSR.

[16]  Chen.  A Distributed Algorithm for Shortest Paths , 1982, IEEE Transactions on Computers.

[17]  K. Mani Chandy,et al.  A distributed algorithm for detecting resource deadlocks in distributed systems , 1982, PODC '82.

[18]  Philip A. Bernstein,et al.  A Sophisticate's Introduction to Distributed Concurrency Control (Invited Paper) , 1982, VLDB.