A matroid approach to finding edge connectivity and packing arborescences
Selected papers of the 23rd annual ACM symposium on Theory of computing
A new, simpler linear-time dominators algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Restricted arc-connectivity of digraphs
Information Processing Letters
Boolean matrix multiplication and transitive closure
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems
SIAM Journal on Computing
Testing 2-vertex connectivity and computing pairs of vertex-disjoint s-t paths in digraphs
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Approximating the smallest 2-vertex connected spanning subgraph of a directed graph
ESA'11 Proceedings of the 19th European conference on Algorithms
Revisiting the tree Constraint
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Finding strong bridges and strong articulation points in linear time
Theoretical Computer Science
| Hi-index | 0.00 |
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].