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]
@inproceedings{PangRD99,
title = {Incremental ::::FO::::(+, <) Maintenance of All-Pairs Shortest Paths for Undirected Graphs after Insertions and Deletions},
author = {Chaoyi Pang and Kotagiri Ramamohanarao and Guozhu Dong},
year = {1999},
tags = {graph-rewriting, maintenance, rewriting, incremental},
researchr = {https://researchr.org/publication/PangRD99},
cites = {0},
citedby = {0},
pages = {365-382},
booktitle = {Database Theory - ICDT 99, 7th International Conference, Jerusalem, Israel, January 10-12, 1999, Proceedings},
editor = {Catriel Beeri and Peter Buneman},
volume = {1540},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-65452-6},
}