The shortest path in parallel

DOI10.1016/S0020-0190(00)00203-9zbMath1003.68198OpenAlexW2073515975MaRDI QIDQ1607105

Beverly A. Sanders

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(00)00203-9

zbMATH Keywords

Dijkstra's shortest path algorithm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)

Uses Software

• UNITY

Cites Work

• A note on two problems in connexion with graphs
• A walk over the shortest path: Dijkstra's algorithm viewed as fixed-point computation.
• Unnamed Item
• Unnamed Item

This page was built for publication: The shortest path in parallel