Incremental FO(+,<) Maintenance of All-pairs Shortest Paths for Undirected Graphs After Insertions and Deletions

TitleIncremental FO(+,<) Maintenance of All-pairs Shortest Paths for Undirected Graphs After Insertions and Deletions
Publication TypeConference Paper
Year of Publication1999
AuthorsRamamohanarao Kotagiri, C. Pang, Guozhu Dong
Conference NameIncremental FO(+,<) Maintenance of All-pairs Shortest Paths for Undirected Graphs After Insertions and Deletions
Full Text

C. Pang, R. Kotagiri and G. Dong. Incremental FO(+,<) Maintenance of All-pairs Shortest Paths for Undirected Graphs After Insertions and Deletions. International Conference on Database Theory (ICDT), Edited by Buneman and Beeri. Jerusalem, pages 365-382, January, 1999. ascii abstract gziped postscript
pages: 365-382
place: Jerusalem
year: 1999
publishtolibrary: True
organization: WSU-CSE
hasEditor: Buneman and Beeri
time: 1/1/1999
venue name: International Conference on Database Theory (ICDT)