I/O-Efficient Algorithms on Near-Planar Graphs

DOI10.1007/11682462_54zbMath1145.05323OpenAlexW1866280507MaRDI QIDQ5900356

Laura Toma, Herman J. Haverkort

Publication date: 18 September 2008

Published in: LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11682462_54

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Via Detours to I/O-Efficient Shortest Paths

This page was built for publication: I/O-Efficient Algorithms on Near-Planar Graphs