Sciweavers

Share
FSTTCS
2000
Springer

Planar Graph Blocking for External Searching

9 years 4 months ago
Planar Graph Blocking for External Searching
We present a new scheme for storing a planar graph in external memory so that any online path can be traversed in an I-O efficient way. Our storage scheme significantly improves the previous results for planar graphs with bounded face size. We also prove an upper bound on I-O efficiency of any storage scheme for well-shaped triangulated meshes. For these meshes, our storage scheme achieves optimal performance. Key Words. External, Graph, Mesh, Planar, Searching.
Surender Baswana, Sandeep Sen
Added 24 Aug 2010
Updated 24 Aug 2010
Type Conference
Year 2000
Where FSTTCS
Authors Surender Baswana, Sandeep Sen
Comments (0)
books