Finding the k shortest paths in parallel

DOI10.1007/S004530010038zbMATH Open0960.68177OpenAlexW2135819212MaRDI QIDQ1580964FDOQ1580964

Authors: 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

Recommendations

• Finding the \(k\) shortest paths in parallel
• Parallel asynchronous algorithms for the \(K\) shortest paths problem
• Finding the k Shortest Paths
• On the k Shortest Simple Paths Problem in Weighted Directed Graphs
• scientific article; zbMATH DE number 56471

zbMATH Keywords

PRAM algorithm

Mathematics Subject Classification ID

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

Cited In (6)

• Finding \(K\) shortest looping paths with waiting time in a time--window network
• Finding the \(k\) shortest paths in parallel
• The shortest path with at most / nodes in each of the series/parallel clusters
• \(k\)-best solutions under distance constraints in valuated \(\Delta\)-matroids
• Δ-stepping: a parallelizable shortest path algorithm
• Title not available (Why is that?)

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

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