Incremental ::::FO::::(+, <) Maintenance of All-Pairs Shortest Paths for Undirected Graphs after Insertions and Deletions

Chaoyi Pang, Kotagiri Ramamohanarao, Guozhu Dong. Incremental ::::FO::::(+, <) Maintenance of All-Pairs Shortest Paths for Undirected Graphs after Insertions and Deletions. In Catriel Beeri, Peter Buneman, editors, Database Theory - ICDT 99, 7th International Conference, Jerusalem, Israel, January 10-12, 1999, Proceedings. Volume 1540 of Lecture Notes in Computer Science, pages 365-382, Springer, 1999. [doi]

Abstract

Abstract is missing.