Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm

DOI10.1137/1.9781611972894.9zbMath1430.68228OpenAlexW1607062769MaRDI QIDQ5233568

Ulrich Meyer, Vitaly Osipov

Publication date: 11 September 2019

Published in: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/5b636d61b978860c914e999d7ff242f97df08b11

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Efficient single-pair all-shortest-path query processing for massive dynamic networks

This page was built for publication: Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm