An Algorithm for Finding a Minimum Equivalent Graph of a Digraph

Dominators, super blocks, and program coverage

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Approximating the minimum equivalent digraph

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms

Efficient coverage testing using global dominator graphs

Proceedings of the 1999 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering

An Algorithm for Finding a Minimal Equivalent Graph of a Digraph

Journal of the ACM (JACM)

Parsing a graph-grammar

CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science

Approximating the minimum strongly connected subgraph via a matching lower bound

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

Digraph Decompositions and Monotonicity in Digraph Searching

Graph-Theoretic Concepts in Computer Science

Approximating Transitive Reductions for Directed Networks

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures

Property-aware program sampling

Proceedings of the 9th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering

Digraph decompositions and monotonicity in digraph searching

Theoretical Computer Science

Compact representation of posets

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation

Query preserving graph compression

SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data