On-line graph algorithms for incremental compilation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 790 LNCS, Issue , 1994, Pages 70-86

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

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF L'AQUILA   (Italy)

^c ICSI   (United States)

^d SIEMENS AG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES;

DYNAMIC MAINTENANCES; DYNAMIC PROBLEM; INCREMENTAL COMPILATION; OFF-LINE ALGORITHM; SIMPLE ALGORITHM; SPACE REQUIREMENTS; TOPOLOGICAL ORDER; TRANSITIVE CLOSURE;

GRAPH THEORY;

EID: 33749022123     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57899-4_42     Document Type: Conference Paper

References (12)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974.
2. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R.E. Tarjan. Dynamic perfect hashing: Upper and lower bounds. Technical Report Bericht Nr. 77, Fachbereich Mathematik-Informatik, Universität-Gesamthochschule Paderborn, 4790 Paderborn, Germany, January 1991, also presented at FOCS '88.
3. G. F. Italiano. Amortized efficiency of a path retrieval data structure. Theoret. Cornput. Sci., 48:273–281, 1986.
4. G. F. Italiano. Finding paths and deleting edges in directed acyclic graphs. Inform. Process. Lett, 28:5–11, 1988.
5. J. A. La Poutré and J. van Leeuwen. Maintenance of transitive closure and transitive reduction of graphs. In Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, 314, pages 106–120. Springer-Verlag, 1988.
6. J. A. McHugh. Algorithmic Graph Theory. Prentice Hall, 1990.
7. K. Mehlhorn. Graph Algorithms and NP-Completeness, volume 2 of Data Structures and Algorithms. Springer-Verlag, Berlin Heidelberg New York Tokyo, 1984.
8. U. Nanni and P. Terrevoli. A fully dynamic data structure for path expressions on dags. R.A.I.R.O. Theorical Informatics and Applications 25, 5, 1991.
9. S. M. Omohundro, C. Lim, and J. Bilmes. The sather language compiler/debugger implementation. Technical Report TR-92-017, International Computer Science Institute, Berkeley, Ca., 1992.
10. R. E. Tarjan. Data structures and network algorithms, volume 44 of CBMS-NSF Regional Conference Series in Applied Mathematics. SIAM, 1983.
11. R. E. Tarjan. Amortized computational complexity. SIAM J. Alg. Disc. Meth., 6:306–318, 1985.
12. D. M. Yellin. Speeding up dynamic transitive closure for bounded degree graphs. Acta Informatica, to appear.