An external memory data structure for shortest path queries (Extended Abstract)

An external memory data structure for shortest path queries (Extended Abstract) (2003)

by David Hutchinson , Anil Maheshwari , Norbert Zeh

Citations:

21 - 7 self

User correction supplied by mph

Datum	Value	Source
TITLE	An external memory data structure for shortest path queries (Extended Abstract)	user correction
AUTHOR NAME	David Hutchinson	user correction
AUTHOR AFFIL	2	user correction
AUTHOR ADDR	Fakultät für Math. und Inf., Friedrich-Schiller-Universität Jena, Germany	user correction
AUTHOR NAME	Anil Maheshwari	user correction
AUTHOR AFFIL	2	user correction
AUTHOR ADDR	Fakultät für Math. und Inf., Friedrich-Schiller-Universität Jena, Germany	user correction
AUTHOR NAME	Norbert Zeh	user correction
AUTHOR AFFIL	2	user correction
AUTHOR ADDR	Fakultät für Math. und Inf., Friedrich-Schiller-Universität Jena, Germany	user correction
ABSTRACT	We present results related to satisfying shortest path queries on a planar graph stored in external memory. In particular, we show how to store rooted trees in external memory so that bottom-up paths can be traversed I/O-efficiently, and we present I/O-efficient algorithms for triangulating planar graphs and computingsmall separators of such graphs. Using these techniques, we can construct a data structure that allows for answering shortest path queries on a planar graph I/O-efficiently.	user correction
YEAR	2003	INFERENCE
PAGES	55--82	INFERENCE
CITATIONS	4 found	ParsCit 1.0