论文信息 - An O(|V|*|E|) Algorithm for Finding Immediate Multiple-Vertex Dominators - 字舞流文

An O(|V|*|E|) Algorithm for Finding Immediate Multiple-Vertex Dominators

Abstract We present an O (¦V¦ ∗ ¦E¦) algorithm for finding immediate multiple-vertex dominators in a graph with vertices V and edges E.

Stephen Alstrup | Jens Clausen | Kristian Jørgensen

[1] Guang R. Gao,et al. DJ-graphs and their application to flow graph analyses , 1994 .

[2] Paul Walton Purdom,et al. Immediate Predominators in a Directed Graph [H] (Algorithm 430) , 1972, Commun. ACM.

[3] Robert E. Tarjan,et al. Finding Dominators in Directed Graphs , 1974, SIAM J. Comput..

[4] Rajiv Gupta. Generalized dominators and post-dominators , 1992, POPL '92.

[5] Rajiv Gupta. Generalized Dominators , 1995, Inf. Process. Lett..

[6] Jeffrey D. Ullman,et al. A Simple Algorithm for Global Data Flow Analysis Problems , 1975, SIAM J. Comput..

[7] Alfred V. Aho,et al. Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[8] Robert E. Tarjan,et al. A fast algorithm for finding dominators in a flowgraph , 1979, TOPL.

[9] Dov Harel,et al. A linear algorithm for finding dominators in flow graphs and related problems , 1985, STOC '85.

[10] Guang R. Gao,et al. A linear time algorithm for placing φ-nodes , 1995, POPL '95.