Finding strong bridges and strong articulation points in linear time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6508 LNCS, Issue PART 1, 2010, Pages 157-169

  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

[No Author keywords available]

Indexed keywords

ARTICULATION POINTS; DIRECTED GRAPHS; LINEAR TIME; LINEAR-TIME ALGORITHMS; OPEN PROBLEMS; STRONGLY CONNECTED COMPONENT;

BEVERAGES; CLUSTERING ALGORITHMS; COMBINATORIAL OPTIMIZATION; GRAPH THEORY;

GRAPH THEORY; DIRECTED GRAPHS;

EID: 78650828376     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-17458-2_14     Document Type: Conference Paper

References (15)

1. Aho, A.V., Garey, M.R., Ullman, J.D.: The transitive reduction of a directed graph. SIAM J. Comput. 1(2), 131-137 (1972)
2. Beldiceanu, N., Flener, P., Lorca, X.: The tree constraint. In: Barták, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, pp. 64-78. Springer, Heidelberg (2005)
3. Buchsbaum, A.L., Georgiadis, L., Kaplan, H., Rogers, A., Tarjan, R.E., Westbrook, J.R.: Linear-time algorithms for dominators and other path-evaluation problems. SIAM Journal on Computing 38(4), 1533-1573 (2008)
4. Buchsbaum, A.L., Kaplan, H., Rogers, A., Westbrook, J.R.: A new, simpler lineartime dominators algorithm. ACM Trans. Program. Lang. Syst. 20(6), 1265-1296 (1998)
5. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)
6. Edmonds, J.: Edge-disjoint branchings. In: Proceedings of the 9th Courant Computer Science Symposium, Combinatorial Algorithms, pp. 91-96. Algorithmics Press (1972)
7. Fischer, M.J., Meyer, A.R.: Boolean matrix multiplication and transitive closure. In: Proceedings of 12th FOCS, pp. 129-131. IEEE, Los Alamitos (1971)
8. Furman, M.E.: 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), 1252 (1970)
9. Gabow, H.N.: A matroid approach to finding edge connectivity and packing arborescences. J. Comput. Syst. Sci. 50(2), 259-273 (1995)
10. Gabow, H.N., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. Journal of Computer and System Sciences 30(2), 209-221 (1985)
11. Georgiadis, L.: Testing 2-vertex connectivity and computing pairs of vertex-disjoint s-t paths in digraphs. In: ICALP 2010: Proceedings of the 37th International Colloquium on Automata, Languages and Programming, pp. 433-442 (2010)
12. Munro, I.: Efficient determination of the transitive closure of a directed graph. Inform. Process. Lett. 1(2), 56-58 (1971)
13. Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM Journal on Computing 1(2), 146-160 (1972)
14. Tarjan, R.E.: Edge-disjoint spanning trees and depth-first search. Acta Inf. 6, 171-185 (1976)
15. Volkmann, L.: Restricted arc-connectivity of digraphs. Inf. Process. Lett. 103(6), 234-239 (2007)