Abstract
Given a directed graph G, an edge is a strong bridge if its removal increases the number of strongly connected components of G. Similarly, we say that a vertex is a strong articulation point if its removal increases the number of strongly connected components of G. In this paper, we present linear-time algorithms for computing all the strong bridges and all the strong articulation points of directed graphs, solving an open problem posed in [2]. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Italiano, G. F., Laura, L., & Santaroni, F. (2010). Finding strong bridges and strong articulation points in linear time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6508 LNCS, pp. 157–169). https://doi.org/10.1007/978-3-642-17458-2_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
