A uniform approach to semi-dynamic problems on digraphs

Theoretical Computer Science

Volumn 203, Issue 1, 1998, Pages 69-90

  Cicerone, Serafino ^a   Frigioni, Daniele ^a,b   Nanni, Umberto ^b   Pugliese, Francesco ^c  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c TELECOM ITALIA   (Italy)

Author keywords

Directed acyclic graphs; Dominator tree; Dynamic graph algorithms; Transitive closure

Indexed keywords

EID: 0012609304     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00288-0     Document Type: Article

References (23)

1. A.V. Aho, R. Sethi, J.D. Ullman, Compilers, Principles, Techniques, and Tools, Addison-Wesley, Reading, MA, 1986.
2. G. Ausiello, G.F. Italiano, A. Marchetti Spaccamela, U. Nanni, Incremental algorithms for minimal length paths, J. Algorithms 12 (1991) 615-638.
3. G. Ausiello, M. Scasso, Algoritmos para mantener dinamicamente clausura transitiva y arbol de dominadores en grafos aciclicos dirigidos, Technical report, Buenos Aires, November 1989.
4. M.D. Carrol, B.G. Ryder, Incremental dataflow update via attribute and dominator update, in: ACM Symp. on Principles of Programming Languages, 1988, pp. 274-284.
5. J. Chu, Optimal algorithms for the nearest common dominator problem, J. Algorithms 13 (1992) 693-697.
6. M.J. Chung, M.S. Krishnamoorthy, Algorithms for placing recovery points, Inform. Process. Lett. 28 (1988) 177-181.
7. R. Cytron, J. Ferrante, B.K. Rosen, M.N. Wegman, K. Zadeck, Efficiently computing static single assignment form and the control dependence graph, ACM Trans. Programming Languages Systems 13 (1991) 451-490.
8. D. Eppstein, Z. Galil, G.F. Italiano, A. Nissenzweig, Sparsification - a technique for speeding up dynamic graph algorithms, in: Proc. IEEE Symp. Found. Comp. Sci. 1992, pp. 60-69.
9. D. Frigioni, A. Marchetti-Spaccamela, U. Nanni, Fully dynamic output bounded single source shortest path problem, in: ACM-SIAM Symp. Discrete Algorithms, 1996, pp. 212-221.
10. Z. Galil, G.F. Italiano, N. Sarnak, Fully dynamic planarity testing, in: ACM Symp. on Theory Comput., 1992, pp. 495-506.
11. F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969.
12. D. Harel, A linear time algorithm for finding dominators in flow graphs and related problems, in: ACM Symp. Theory Comput., 1985, pp. 185-194.
13. D. Harel, R.E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM J. Comput. 13 (1984) 338-355.
14. G.F. Italiano, Amortized efficiency of a path retrieval data structure, Theoret. Comput. Sci. 48 (1986) 273-281.
15. G.F. Italiano, Finding paths and deleting edges in directed acyclic graphs, Inform. Process. Lett. 28 (1988) 5-11.
16. P.N. Klein, S. Rao, M. Rauch, S. Subramanian, Faster shortest-path algorithms for planar graphs, in: ACM Symp. on Theory of Computing, Montreal, Quebec, Canada, 1994, pp. 27-37.
17. J. A. La Poutré, J, van Leeuwen, Maintenance of transitive closure and transitive reduction of graphs, in: International Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, vol. 314, Springer, Berlin, 1988, 99, 106-120.
18. T. Lengauer, R.E. Tarjan, A fast algorithm for finding dominators in a flowgraph, ACM Trans. on Programming Languages and Systems 1(1) (1979) 121-141.
19. S.R. Pawagi, I.V. Ramakrishnan P.S. Gopalakrishnan, Computing dominators in parallel, Inform. Process. Lett. 24 (1987) 217-221.
20. G. Ramalingam, T. Reps, An incremental algorithm for maintaining the dominator tree of a reducible flowgraph, in: ACM Symp. on Principles of Programming Languages, 1994, pp. 287-296.
21. M. Rauch, Fully dynamic biconnectivity in graphs, in: IEEE Symp. on Found Comput. Sci., 1992, pp. 50-59.
22. S. Subramanian, A fully dynamic data structure for reachability in planar digraphs, in: Proc. ESA '93, Lecture Notes in Computer Science, vol. 726, Springer, Berlin, 1993, pp. 372-383.
23. R.E. Tarjan, Finding dominators in directed graphs, SIAM J. Comput. 3(1) (1974) 62-89.