Maintaining a topological order under edge insertions

Information Processing Letters

Volumn 59, Issue 1, 1996, Pages 53-58

  Marchetti Spaccamela, Alberto ^a   Nanni, Umberto ^a,b   Rohnert, Hans ^a,c  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF L'AQUILA   (Italy)

^c SIEMENS AG   (Germany)

Author keywords

Algorithms; Amortized analysis; Dynamic graphs; Incremental algorithms

Indexed keywords

EID: 0004454557     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00075-0     Document Type: Article

References (10)

1. G.F. Italiano, Amortized efficiency of a path retrieval data structure, Theoret. Comput. Sci. 48 (1986) 273-281.
2. G.F. Italiano, Finding paths and deleting edges in directed acyclic graphs, Inform. Process. Lett. 28 (1988) 5-11.
3. J.A. La Poutré and J. van Leeuwen, Maintenance of transitive closure and transitive reduction of graphs, in: Proc. Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 314 (Springer, Berlin, 1988) 106-120.
4. K. Mehlhorn, Data Structures and Algorithms. Vol. 2. Graph Algorithms and NP-Completeness (Springer, Berlin, 1984).
5. K. Mehlhorn and S. Näher, LEDA, a platform for combinatorial and geometric computing, Comm. ACM 38 (1995).
6. U. Nanni and P. Terrevoli, A fully dynamic data structure for path expressions on dags, RAIRO Inform. Théor. Appl. 25 (5) (1991).
7. S.M. Omohundro, C. Lim and J. Bilmes, The Sather language compiler/debugger implementation, Tech. Rept. TR-92-017, International Computer Science Institute, Berkeley, CA, 1992.
8. R.E. Tarjan, Data Structures and Network Algorithms, CBMS-NSF Regional Conference Series in Applied Mathematics 44 (SIAM, Philadelphia, PA, 1983).
9. R.E. Tarjan, Amortized computational complexity, SIAM J. Algebra Discrete Methods 6 (1985) 306-318.
10. D.M. Yellin, Speeding up dynamic transitive closure for bounded degree graphs, Acta Inform., to appear.