Generating node coordinates for shortest-path computations in transportation networks

DOI10.1145/1005813.1005815zbMATH Open1080.90011OpenAlexW2109256116MaRDI QIDQ5463448FDOQ5463448

Authors: Ulrik Brandes, Frank Schulz, Dorothea Wagner, Thomas Willhalm 

Publication date: 4 August 2005

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-72120

Recommendations

• scientific article; zbMATH DE number 1893565
• A two-phase shortest path algorithm for networks with node coordinates
• Algorithms – ESA 2005
• scientific article; zbMATH DE number 5734726
• An experimental evaluation of point-to-point shortest path calculation on road networks with precalculated edge-flags

zbMATH Keywords

shortest pathstransportation networksgraph drawingtravel planning

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Graph representations (geometric and intersection representations, etc.) (05C62) Transportation, logistics and supply chain management (90B06)

Cited In (2)

• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Generating node coordinates for shortest-path computations in transportation networks

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