Finding strong bridges and strong articulation points in linear time

Theoretical Computer Science

Volumn 447, Issue , 2012, Pages 74-84

  Italiano, Giuseppe F ^a   Laura, Luigi ^b   Santaroni, Federico ^a  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Graph algorithms; Strong articulation points; Strong bridges; Strong connectivity

Indexed keywords

ARTICULATION POINTS; GRAPH ALGORITHMS; LINEAR TIME; LINEAR-TIME ALGORITHMS; STRONG CONNECTIVITY; STRONGLY CONNECTED COMPONENT;

CLUSTERING ALGORITHMS;

DIRECTED GRAPHS;

EID: 84863326656     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2011.11.011     Document Type: Conference Paper

References (21)

1. Alfred V. Aho, Michael R. Garey, and Jeffrey D. Ullman The transitive reduction of a directed graph SIAM J. Comput. 1 2 1972 131 137
2. Nicolas Beldiceanu, Pierre Flener, and Xavier Lorca The tree constraint Proc. 2nd Int. Conf. on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems CPAIOR 2005 LNCS vol. 3524 2005 Springer-Verlag 64 78
3. Dario Bini, and Victor Y. Pan Polynomial and Matrix Computations (vol. 1): Fundamental Algorithms 1994 Birkhauser Verlag Basel, Switzerland
4. Adam L. Buchsbaum, Loukas Georgiadis, Haim Kaplan, Anne Rogers, Robert E. Tarjan, and Jeffery R. Westbrook Linear-time algorithms for dominators and other path-evaluation problems SIAM J. Comput. 38 4 2008 1533 1573
5. Adam L. Buchsbaum, Haim Kaplan, Anne Rogers, and Jeffery R. Westbrook A new, simpler linear-time dominators algorithm ACM Trans. Program. Lang. Syst. 20 6 1998 1265 1296
6. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein Introduction to Algorithms 3rd ed. 2009 MIT Press
7. Jack Edmonds Edge-disjoint branchings Proceedings of the 9th Courant Computer Science Symposium, Combinatorial Algorithms 1972 Algorithmics Press 91 96
8. Ya.M. Erusalimskii, and G.G. Svetlov Bijoin points, bibridges, and biblocks of directed graphs Cybernetics and Systems Analysis 16 1980 41 44
9. Abdol-Hossein Esfahanian, and S. Louis Hakimi On computing a conditional edge-connectivity of a graph Inf. Process. Lett. 27 1988 195 199
10. Michael J. Fischer, and Albert R. Meyer Boolean matrix multiplication and transitive closure Proceedings of 12th FOCS 1971 IEEE 129 131
11. M.E. Furman Applications of a method of fast multiplication of matrices in the problem of finding the transitive closure of a graph Soviet Math. Dokl. 11 5 1970 1252
12. Harold N. Gabow A matroid approach to finding edge connectivity and packing arborescences J. Comput. Syst. Sci. 50 2 1995 259 273
13. Harold N. Gabow, and Robert E. Tarjan A linear-time algorithm for a special case of disjoint set union J. Comput. System Sci. 30 2 1985 209 221
14. Loukas Georgiadis, Testing 2-vertex connectivity and computing pairs of vertex-disjoint s-t paths in digraphs, in: ICALP 10: Proceedings of the 37th International Colloquium on Automata, Languages and Programming, 2010, pp. 433-442.
15. Giuseppe F. Italiano, Luigi Laura, and Federico Santaroni Finding strong bridges and strong articulation points in linear time Proceedings of the 4th International Conference on Combinatorial Optimization and Applications COCOA 2010 Lecture Notes in Computer Science vol. 6508 2010 Springer 157 169
16. David W. Matula, Rakesh. V. Vohra, Calculating the connectivity of a directed graph, Technical Report 386, Institute for Mathematics and Application, University of Minnesota, 1988.
17. J.S. Maybee, D.D. Olesky, P. van den Driessche, and G. Wiener Matrices, digraphs, and determinants SIAM J. Matrix Anal. Appl. 10 1989 500 519
18. Ian Munro Efficient determination of the transitive closure of a directed graph Inform. Process. Lett. 1 2 1971 56 58
19. Robert E. Tarjan Depth-first search and linear graph algorithms SIAM J. Comput. 1 2 1972 146 160
20. Robert E. Tarjan Edge-disjoint spanning trees and depth-first search Acta Inf. 6 1976 171 185
21. Lutz Volkmann Restricted arc-connectivity of digraphs Inf. Process. Lett. 103 6 2007 234 239