Incremental data flow analysis via dominator and attribute update
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An incremental algorithm for maintaining the dominator tree of a reducible flowgraph
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Efficient program analysis using DJ graphs
Efficient program analysis using DJ graphs
Incremental computation of dominator trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
A uniform approach to semi-dynamic problems on digraphs
Theoretical Computer Science - Special issue: graph theoretic concepts in computer science
Data structures for weighted matching and nearest common ancestors with linking
SODA '90 Proceedings of the first 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)
Immediate predominators in a directed graph [H]
Communications of the ACM
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 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
Dynamic Dominators in Practice
PCI '11 Proceedings of the 2011 15th Panhellenic Conference on Informatics
The runtime structure of object ownership
ECOOP'06 Proceedings of the 20th European conference on Object-Oriented Programming
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
| Hi-index | 0.00 |
Motivated by recent applications of dominator computations we consider the problem of dynamically maintaining the dominators of a flowgraph through a sequence of insertions and deletions of edges. We present new algorithms and efficient implementations of existing algorithms and exhibit their efficiency in practice.