Improved Distance Queries in Planar Graphs

DOI10.1007/978-3-642-22300-6_54zbMath1342.68113arXiv1012.2825OpenAlexW1792146362MaRDI QIDQ5199280

Yahav Nussbaum

Publication date: 12 August 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1012.2825

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Data structures (68P05)

Related Items (6)

Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time ⋮ Faster shortest paths in dense distance graphs, with applications ⋮ Shortest-path queries in static networks ⋮ Non-crossing shortest paths in undirected unweighted planar graphs in linear time ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Improved Distance Queries in Planar Graphs