Planar point location using persistent search trees
Communications of the ACM
Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Filtering search: a new approach to query answering
SIAM Journal on Computing
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
SIAM Journal on Computing
Computing vertex connectivity: new bounds from old techniques
Journal of Algorithms
A fast algorithm for finding dominators in a flowgraph
ACM Transactions on Programming Languages and Systems (TOPLAS)
Introduction to Algorithms
Optimal bounds for the predecessor problem and related problems
Journal of Computer and System Sciences - STOC 1999
Finding dominators revisited: extended abstract
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Corrigendum: a new, simpler linear-time dominators algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Dominator tree verification and vertex-disjoint paths
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Linear-time algorithms for dominators and related problems
Linear-time algorithms for dominators and related problems
Using expander graphs to find vertex connectivity
Journal of the ACM (JACM)
Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems
SIAM Journal on Computing
Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time
SIAM Journal on Computing
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
Join-reachability problems in directed graphs
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Approximating the smallest 2-vertex connected spanning subgraph of a directed graph
ESA'11 Proceedings of the 19th European conference on Algorithms
Finding strong bridges and strong articulation points in linear time
Theoretical Computer Science
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
Finding dominators via disjoint set union
Journal of Discrete Algorithms
| Hi-index | 0.00 |
We present an O(m+n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this result we design an O(n)- space data structure that can compute in O(log2 n) time two internally vertex-disjoint paths from s to t, for any pair of query vertices s and t of a 2-vertex connected directed graph. The two paths can be reported in additional O(k) time, where k is their total length.