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

DOI10.1007/978-3-642-10631-6_118zbMath1272.05194OpenAlexW1516543827MaRDI QIDQ3652302

Anil Maheshwari, Meng He, Norbert Zeh, Craig Dillabaugh

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://ir.library.carleton.ca/pub/4776

zbMATH Keywords

block sizepath lengthrepresentation of bounded-degree planar graphstriangular-irregular network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

This page was built for publication: I/O and Space-Efficient Path Traversal in Planar Graphs