Levelwise mesh sparsification for shortest path queries

DOI10.1007/978-3-642-17517-6_13MaRDI QIDQ3060727zbMATH OpenOpenAlexFDO

Authors Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo

Publication date 9 December 2010

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

Full work available at URL https://doi.org/10.1007/978-3-642-17517-6_13

Mathematics Subject Classification ID

Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Engineering Highway Hierarchies
• Algorithms – ESA 2005
• Engineering highway hierarchies
• Geometric speed-up techniques for finding shortest paths in large sparse graphs
• High-performance multi-level routing

This page was built for publication: Levelwise mesh sparsification for shortest path queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3060727)