On computing a conditional edge-connectivity of a graph
Information Processing Letters
Matrices, digraphs, and determinants
SIAM Journal on Matrix Analysis and Applications
Polynomial and matrix computations (vol. 1): fundamental algorithms
Polynomial and matrix computations (vol. 1): fundamental algorithms
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
Finding strong bridges and strong articulation points in linear time
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Dominators, directed bipolar orders, and independent spanning trees
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Computing strong articulation points and strong bridges in large scale graphs
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
An experimental study of dynamic dominators
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Bootstrapping software distributions
Proceedings of the 16th International ACM Sigsoft symposium on Component-based software engineering
Finding dominators via disjoint set union
Journal of Discrete Algorithms
| Hi-index | 5.23 |
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 Beldiceanu et al. (2005) [2].