Encoding shortest paths in spatial networks

DOI10.1002/NET.3230260412MaRDI QIDQ4894867zbMATH OpenOpenAlexFDO

Authors Martin Erwig

Publication date 7 October 1996

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230260412

zbMATH Keywords

biconnected componentsshortest paths in spatially embedded planar networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Shortest path queries in planar graphs
• Multiple-source shortest paths in planar graphs
• Planar graph decomposition and all pairs shortest paths
• Engineering Highway Hierarchies
• scientific article; zbMATH DE number 176745

Cites work

• Faster shortest-path algorithms for planar graphs
• scientific article; zbMATH DE number 3744581 (Why is no real title available?)
• scientific article; zbMATH DE number 742976 (Why is no real title available?)

Cited in

(3)

• Compact representation of GPS trajectories over vectorial road networks
• Compressing optimal paths with run length encoding
• scientific article; zbMATH DE number 1542607 (Why is no real title available?)

This page was built for publication: Encoding shortest paths in spatial networks

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