On-line graph algorithms for incremental compilation

DOI10.1007/3-540-57899-4_42zbMath1528.68310OpenAlexW1498578111MaRDI QIDQ6184394

Umberto Nanni, Hans Rohnert, Alberto Marchetti-Spaccamela

Publication date: 5 January 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-57899-4_42

zbMATH Keywords

directed acyclic graphtransitive closuretopological orderedge deletionloop detection

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Online algorithms; streaming algorithms (68W27)

Cites Work

• Amortized efficiency of a path retrieval data structure
• Finding paths and deleting edges in directed acyclic graphs
• Speeding up dynamic transitive closure for bounded degree graphs
• Amortized Computational Complexity
• Dynamic Perfect Hashing: Upper and Lower Bounds
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On-line graph algorithms for incremental compilation