Sub-linear Distributed Algorithms for Sparse Certificates and Biconnected Components

Journal of Algorithms

Volumn 23, Issue 1, 1997, Pages 160-179

  Thurimella, Ramakrishna ^a  

^a UNIVERSITY OF DENVER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0345810338     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0832     Document Type: Article

References (14)

1. B. Awerbuch and D. Peleg, Network synchronization with polylogarithmic overhead, in "Proc. 31st Symp. Found. Comp. Sci., 1990," pp. 514-522.
2. J. Cheriyan, M. Kao, and R. Thurimella, Scan-first search and sparse certificates: An improved parallel algorithm for k-vertex connectivity, SIAM J. Comput. 22(1) (1993), 157-174.
3. S. Even, G. Itkis, S. Rajsbaum, On mixed connectivity certificates, in "Proc. European Symp. on Algorithms," LNCS, vol. 979 (1995), pp. 1-16; to appear in Mathematical Systems Theory.
4. J. Gayay, S. Kutten, and D. Peleg, A sub-linear time distributed algorithm for minimum-weight spanning trees, in "Proc. 34th Symp. Found. Comp. Sci., 1993," pp. 659-668.
5. M. R. Garey and D. S. Johnson, "Computers and Intractability: A guide to the Theory of NP-Completeness," Freeman, San Francisco, 1979.
6. V. Hadzilacos, Connectivity requirements for Byzantine agreement under restricted types of failures, Distrib. Comput. 2 (1987), 95-103.
7. W. Hohberg, How to find biconnected components in distributed networks, J. Parallel Distrib. Comput. 9(4) (1990), 374-386.
8. S. T. Huang, A new distributed algorithm for the bioconnectivity problem, in "Proc. 1989 Int. Conf. on Parallel Processing, 1989," Vol. III, pp. 106-113.
9. A. Itai and M. Rodeh, The multi-tree approach to reliability in distributed networks, Inform. Comput. 79 (1988), 43-59.
10. E. Jennings and L. Motyčková, Message and time efficient distributed algorithms for sparse k-connectivity certificates, in "Proc. 15th Ann. ACM Symp. on Principles of Distributed Computing, (1996)," pp. 180.
11. S. Kutten and D. Peleg, Fast distributed construction of k-dominating sets and applications, in "Proc. of 14th Ann. ACM Symp. on Principles of Distributed Computing, 1995," pp. 238-249.
12. H. Nagamochi and T. Ibaraki, Linear time algorithms for finding k-edge-connected and k-node-connected spanning subgraphs, Algorithmica 7 (1992), 583-596.
13. R. Thurimella, "Techniques for the design of parallel graph algorithms," Ph.D. thesis, The University of Texas at Austin, Aug. 1989.
14. R. E. Tarjan and U. Vishkin, An efficient parallel biconnectivity algorithm, SIAM J. Comput. 14 (1984), 862-874.