Approximate Shortest Path Queries Using Voronoi Duals

DOI10.1007/978-3-642-16007-3_2zbMath1309.68197OpenAlexW2140171877MaRDI QIDQ3052756

Christian Sommer, Martin Wolff, Shinichi Honiden, Michael E. Houle

Publication date: 2 November 2010

Published in: Transactions on Computational Science IX (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-16007-3_2

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Related Items (2)

Boosting the Exploration of Huge Dynamic Graphs ⋮ Shortest-path queries in static networks

This page was built for publication: Approximate Shortest Path Queries Using Voronoi Duals