Finding the \(k\) shortest paths in parallel

DOI10.1007/s004530010038zbMath0960.68177OpenAlexW2135819212MaRDI QIDQ1580964

Eric Ruppert

Publication date: 14 September 2000

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004530010038

zbMATH Keywords

PRAM algorithm

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Data structures (68P05)

Related Items (2)

Finding \(K\) shortest looping paths with waiting time in a time--window network ⋮ \(k\)-best solutions under distance constraints in valuated \(\Delta\)-matroids

This page was built for publication: Finding the \(k\) shortest paths in parallel