External-memory exact and approximate all-pairs shortest-paths in undirected graphs.
Rezaul Alam ChowdhuryVijaya RamachandranPublished in: SODA (2005)
Keyphrases
- exact and approximate
- external memory
- undirected graph
- main memory
- memory space
- shortest path
- memory efficient
- data structure
- directed graph
- range queries
- approximation algorithms
- query evaluation
- directed acyclic graph
- lower bound
- minimum cost
- complex networks
- string matching
- graph structure
- connected components
- block size
- spanning tree
- xpath queries
- random access
- algorithms require
- dynamic programming
- social networks
- branch and bound
- database management systems
- lower and upper bounds
- special case
- data sets
- np hard
- databases