Incremental FO(+; !) maintenance of all-pairs shortest paths for undirected graphs after insertions and deletions (1999)

by C Pang, R Kotagiri, G Dong
Venue:In Proceedings of International Conference on Database Theory (ICDT), Edited by Buneman