(+, <) Maintenance of All-Pairs Shortest Paths for Undirected Graphs after Insertions and Deletions.
Chaoyi PangKotagiri RamamohanaraoGuozhu DongPublished in: ICDT (1999)
Keyphrases
- undirected graph
- insertions and deletions
- data structure
- directed acyclic graph
- directed graph
- approximation algorithms
- labeling scheme
- shortest path
- graph structure
- spanning tree
- complex networks
- xml documents
- minimum cost
- connected components
- disjoint paths
- strongly connected
- vertex set
- database
- multicommodity flow
- np hard