Planar graph blocking for external searching

DOI10.1007/s00453-002-0969-2zbMath1016.68032OpenAlexW1999425716MaRDI QIDQ1849382

Surender Baswana, Sandeep Sen

Publication date: 1 December 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-002-0969-2

zbMATH Keywords

I-O efficiencywell-shaped triangulated meshes

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Related Items

I/O-efficient path traversal in succinct planar graphs