Issue No. 09 - September (1989 vol. 38)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.29464
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
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. , pp. 1240-1248, September 1989, doi:10.1109/12.29464