Author:
Georgiadis Loukas,Italiano Giuseppe F.,Laura Luigi,Santaroni Federico
Publisher
Springer Berlin Heidelberg
Reference29 articles.
1. Allen, F.E., Cocke, J.: Graph theoretic constructs for program control flow analysis. Technical Report IBM RC 3923, IBM T.J. Watson Research (1972)
2. Alstrup, S., Harel, D., Lauridsen, P.W., Thorup, M.: Dominators in linear time. SIAM Journal on Computing 28(6), 2117–2132 (1999)
3. Alstrup, S., Lauridsen, P.W.: A simple dynamic algorithm for maintaining a dominator tree. Technical Report 96-3, Department of Computer Science, University of Copenhagen (1996)
4. Buchsbaum, A.L., Georgiadis, L., Kaplan, H., Rogers, A., Tarjan, R.E., Westbrook, J.R.: Linear-time algorithms for dominators and other path-evaluation problems. SIAM Journal on Computing 38(4), 1533–1573 (2008)
5. Buchsbaum, A.L., Kaplan, H., Rogers, A., Westbrook, J.R.: A new, simpler linear-time dominators algorithm. ACM Trans. on Programming Languages and Systems 27(3), 383–387 (2005)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fully Dynamic 2-Hop Cover Labeling;ACM Journal of Experimental Algorithmics;2019-12-17
2. Dynamic Dominators and Low-High Orders in DAGs;LEIBNIZ INT PR INFOR;2019
3. Maintaining Canonical Form After Edge Deletion;Proceedings of the 13th Workshop on Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems;2018-07-17
4. Visual Analysis of Vertex-Disjoint Path Connectivity in Networks;2018 22nd International Conference Information Visualisation (IV);2018-07
5. Incremental Strong Connectivity and 2-Connectivity in Directed Graphs;LATIN 2018: Theoretical Informatics;2018