Parallel algorithms for connectivity problems in graph theory

References

• Atallah , M.J. 1984 . Parallel strong orientation of an undirected graph . Inf. Proc. Lett , 18 : 37 – 39 .
   Web of Science ®Google Scholar
• Berge , C. 1973 . Graphs and Hypergraphs, 1-11 , London : North-Holland and American Elsevier .
   Google Scholar
• Ghosh , R.K. and Bhattacharjee , G.P. 1984 . A parallel search algorithm for directed acyclic graphs . BIT , 24 : 134 – 150 . Part I
   Google Scholar
• Ghosh , R.K. and Bhattacharjee , G.P. 1984 . Parallel breadth-first search algorithms for trees and graphs . Int. J. Computer Maths , 15 ( 3+4 ) : 255 – 268 . Section A
   Web of Science ®Google Scholar
• Gotleib , C.C. and Corneil , D.G. 1967 . Algorithms for finding a fundamental set of cycles of an undirected linear graph . CACM , 10 ( 3+4 ) : 780 – 783 .
   Web of Science ®Google Scholar
• Paton , K. 1969 . An algorithm for finding a fundamental set of cycles of a graph . CACM , 12 ( 3+4 ) : 514 – 518 .
   Web of Science ®Google Scholar
• Reingold , E.M. , Nievergelt , J. and Deo , N. 1977 . Combinatorial Algorithms: Theory and Practice , Englewood Cliffs , New Jersey : Prentice-Hall .
   Google Scholar
• Savage , C. and JaJa , J. 1981 . Fast, efficient parallel algorithms for some graph problems . SIAM J. Comput , 10 : 682 – 691 .
   Web of Science ®Google Scholar
• Savage , C. 1977 . “ Parallel algorithms for graph theoretic problems ” . In Ph.D. Thesis , University of Illinois . CSL Rep. ACT-4
   Google Scholar
• Tarjan , R.E. 1974 . Finding dominators in a directed graph . SIAM J. Comput , 3 : 62 – 89 .
   Google Scholar
• Tarjan , R.E. 1974 . A note on finding the bridges of a graph . Inf. Proc. Lett , 2 : 160 – 161 .
   Google Scholar
• Tarjan , R.E. and Vishkin , U. 1983 . “ An efficient parallel biconnectivity algorithm ” . In Ultracomputer Note-51 , New York : Courant Institute of Mathematical Sciences . TR-69
   Google Scholar
• Welch , J.T. Jr . 1966 . Mechanical analysis of cyclic structure of undirected linear graphs . JACM , 13 : 205 – 210 .
   Web of Science ®Google Scholar
• Wyllie , J. 1979 . “ Complexity of parallel computations ” . In Ph.D. Thesis , New York : Cornell University . TR-79-387
   Google Scholar