I/O and Space-Efficient Path Traversal in Planar Graphs.

Craig Dillabaugh Meng He Anil Maheshwari Norbert Zeh

Published in: ISAAC (2009)

Keyphrases

space efficient
planar graphs
data structure
main memory
data streams
sliding window
shortest path
b tree
index structure
tree structure
minimum weight
upper bound
weighted graph
approximate inference