Title of article
An external memory data structure for shortest path queries Original Research Article
Author/Authors
David Hutchinson، نويسنده , , Anil Maheshwari، نويسنده , , Norbert Zeh، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
28
From page
55
To page
82
Abstract
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and sort(N) denote the number of input/output (I/O) operations required to sort an array of length N:
(1)We describe a blocking for rooted trees to support bottom-u
Keywords
External-memory algorithms , Graph algorithms , Shortest paths , Planar graphs
Journal title
Discrete Applied Mathematics
Serial Year
2003
Journal title
Discrete Applied Mathematics
Record number
885506
Link To Document