On-line Graph Algorithms for Incremental Compilation (1992)
by
Alberto Marchetti-Spaccamela
,
Hans Rohnert
,
Umberto Nanni
| Citations: | 16 - 0 self |
BibTeX
@MISC{Marchetti-Spaccamela92on-linegraph,
author = {Alberto Marchetti-Spaccamela and Hans Rohnert and Umberto Nanni},
title = {On-line Graph Algorithms for Incremental Compilation},
year = {1992}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Compilers usually construct various data structures which often vary only slightly fi'om compilation run to compilation run. This paper gives various solutions to the problems of quickly updating these data structures instead of building them from scratch each time. All problems we found can be reduced to graph problems. Specifically, we give algorithms for updating data structures for the problems of topological order, loop detection, and reachability from the start routine.
Citations
| 2172 | The Design and Analysis of Computer Algorithms - Aho, Hopcroft, et al. - 1974 |
| 129 | Amortized computational complexity - Tarjan - 1985 |
| 123 | Dynamic perfect hashing: Upper and lower bounds - Dietzfelbinger, Karlin, et al. - 1994 |
| 49 | Algorithmic Graph Theory - McHugh - 1990 |
| 38 | Data Structures and Network Algorithms, volume 44 - Tarjan - 1983 |
| 32 | Amortized efficiency of a path retrieval data structure - Italiano - 1986 |
| 28 | Finding paths and deleting edges in directed acyclic graphs - Italiano - 1988 |
| 15 | Graph algorithms and NP-completeness, volume 2 of Data structures and algorithms - Mehlhorn - 1984 |
| 10 | The sather language compiler/debugger implementation - Omohundro, Lim, et al. - 1992 |
| 4 | Maintenance of transitive closure and transitive reduction of graphs - Poutr', L, et al. - 1988 |
| 1 | A fully dynamic data structure for path expressions on dags - Nanni, Terrevoli - 1992 |
