A simple parallel algorithm for the single-source shortest path problem on planar digraphs

DOI10.1006/JPDC.2000.1646zbMath0966.68230OpenAlexW2012329847MaRDI QIDQ5926351

Christos D. Zaroliagis, Jesper Larsson Träff

Publication date: 28 February 2001

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.2000.1646

zbMATH Keywords

planar digraphssingle-source shortest path problem

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (1)

Analysis of average shortest-path length of scale-free network

This page was built for publication: A simple parallel algorithm for the single-source shortest path problem on planar digraphs