This Article 
 Bibliographic References 
 Add to: 
Distributed Algorithms for Network Recognition Problems
September 1989 (vol. 38 no. 9)
pp. 1240-1248
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 algorith

[1] R. G. Gallager, P. A. Humblet, and P. M. Spira, "A distributed algorithm for minimum weight spanning trees,"ACM Trans. Programming Languages and Syst., vol. 5, no. 1, pp. 66-67, Jan. 1983.
[2] G. L. Peterson, "An O(n log n) unidirectional algorithm for the circular extrema problem,"ACM Trans. Programming Languages Syst., vol. 4, pp. 758-762, 1982.
[3] N. Santoro, "Distributed algorithms for very large distributed environments: New results and research directions," inProc. 1981 Canadian Inform. Processing Soc., pp. 1.4.1-1.4.5.
[4] T. Y. Cheung, "Graph traversal techniques and the maximum flow problem in distributed computation,"IEEE Trans. Software Eng., vol. SE-9, no. 4, pp. 504-512, July 1983.
[5] E. J. H. Chang, "Echo algorithms: Depth parallel operations on general graphs,"IEEE Trans. Software Eng., vol. SE-8, no. 4, pp. 391-401, July 1982.
[6] C. C. Chen, "A distributed algorithm for shortest paths,"IEEE Trans. Comput., vol. C31, no. 9, pp. 898-899, Sept. 1982.
[7] E. W. Dijkstra and C. S. Schotten, "Termination detection for defussing computations,"I.P.L., vol. 11, no. 1, pp. 1-4, Aug. 1980.
[8] J. Misra and K.M. Chandy, "A distributed graph algorithm: Knot detection,"ACM Trans. Programming Languages Syst., vol. 4, no. 4, pp. 678-688, Oct. 1982.
[9] K. Marzullo and S. Owicki, "Maintaining time in a distributed system," inProc. 2nd ACM Symp. Principles of Distributed Computing, Aug. 1983, pp. 295-305.
[10] J. Misra, "Detecting Termination Detection of Distributed Computations Using Markers,"Proc. Symp. Principles of Distributed Computing, ACM Press, New York, 1983, pp. 290-294.
[11] P.A. Bernstein and N. Goodman, "A Sophisticate's Introduction to Distributed Database Concurrency Control,"Proc. Eighth Very Large Database Conf., Morgan Kaufmann, Palo Alto, Calif., 1982, pp. 62-76.
[12] K. M. Chandy and J. Misra, "A distributed algorithm for detecting resource deadlocks in distributed systems," inProc. ACM SIGACT-SIGOPS Symp. Principles of Distributed Computing, Ottawa, Ont., Canada, Aug. 1982.
[13] K. M. Chandy and J. Misra, "A computation on graphs: Shortest path algorithms,"Commun. ACM, vol. 25, no. 11, pp. 833-837, Nov. 1982.
[14] E. Korach, D. Rotem, and N. Santoro, "Distributed algorithms for finding centers and medians in networks,"ACM Trans. Programming Lang. Syst., vol. 6, no. 3, pp. 380-401, July 1984.
[15] D. S. Parker and B. Samadi, "Adaptive distributed minimal spanning tree algorithms," inProc. 1st Symp. Reliability Distrib. Software Databases, 1981.
[16] F. Chin and H. F. Ting, "An almost linear time andO(nlogn+e) messages distributed algorithm for minimum-weight spanning trees," inProc. 26th IEEE FOCS, 1985, pp. 257-266.
[17] B. Awerbuch and R. G. Gallager, "Distributed BFS algorithms," inProc. 26th IEEE FOCS, 1985, pp. 250-256.
[18] G. N. Frederickson, "A single-source shortest path algorithm for planar distributed network," inProc. STACS 85(Lecture Notes Comput. Sci., Vol. 182). Berlin: Springer-Verlag, 1985, pp. 143-150.
[19] B. Awerbuch, "Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems," inProc. ACM STOC, 1987, pp. 230-240.
[20] B. Schieber and S. Moran, "Slowing sequential algorithms for obtaining fast distributed and parallel algorithms: Maximum matchings," inProc. 5th ACM PODC, 1986, pp. 282-292.
[21] M. C. Wu, "An efficient distributed algorithm for maximum matching in general graphs," M.S. Thesis, Coordinated Sci. Lab., Univ. of Illinois at Urbana-Champaign, 1987.
[22] K. V. S. Ramarao and S. Venkatesan, "On finding and updating shortest paths distributively," inProc. 24th Allerton Conf., 1986.

Index Terms:
unified algorithms; communication complexity; distributed algorithms; network recognition; tree; ring; star; complete graph; bipartite graph; centralized; decentralized; noncentralized initiations; time complexities; computational complexity; computer networks; distributed processing.
K.V.S. Ramarao, "Distributed Algorithms for Network Recognition Problems," IEEE Transactions on Computers, vol. 38, no. 9, pp. 1240-1248, Sept. 1989, doi:10.1109/12.29464
Usage of this product signifies your acceptance of the Terms of Use.