Efficiently computing static single assignment form and the control dependence graph
ACM Transactions on Programming Languages and Systems (TOPLAS)
Directed s-t numberings, rubber bands, and testing digraph k-vertex connectivity
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
SIAM Journal on Computing
A fast algorithm for finding dominators in a flowgraph
ACM Transactions on Programming Languages and Systems (TOPLAS)
Testing flow graph reducibility
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Fault Equivalence Identification Using Redundancy Information and Static and Dynamic Extraction
VTS '01 Proceedings of the 19th IEEE VLSI Test Symposium
Finding dominators revisited: extended abstract
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
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 Other Path-Evaluation Problems
SIAM Journal on Computing
Diagnosing memory leaks using graph mining on heap dumps
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
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
Approximating the smallest 2-vertex connected spanning subgraph of a directed graph
ESA'11 Proceedings of the 19th European conference on Algorithms
Using dominators for solving constrained path problems
PADL'06 Proceedings of the 8th international conference on Practical Aspects of Declarative Languages
Computer Science Review
Finding strong bridges and strong articulation points in linear time
Theoretical Computer Science
Linear time algorithms for two disjoint paths problems on directed acyclic graphs
Theoretical Computer Science
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 consider problems related to dominators and independent spanning trees in flowgraphs and provide linear-time algorithms for their solutions. We introduce the notion of a directed bipolar order, generalizing a previous notion of Plein and Cheriyan and Reif. We show how to construct such an order from information computed by several known algorithms for finding dominators. We show how to concurrently verify the correctness of a dominator tree D and a directed bipolar order O very simply, and how to construct from D and O two spanning trees whose paths are disjoint except for common dominators. Finally, we describe alternative ways to verify dominators without using a directed bipolar order.