Finding the k shortest paths in parallel

DOI10.1007/BFB0023482zbMATH Open1498.68215OpenAlexW1549783832MaRDI QIDQ5048947FDOQ5048947

Authors: Eric Ruppert 

Publication date: 9 November 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

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

data structuresparallel algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Parallel algorithms in computer science (68W10)

Cites Work

• Fibonacci heaps and their uses in improved network optimization algorithms
• Finding the K Shortest Loopless Paths in a Network
• Routing, merging, and sorting on parallel models of computation
• Title not available (Why is that?)
• The complexity of selection and ranking in X+Y and matrices with sorted columns
• Algorithms for the constrained quickest path problem and the enumeration of quickest paths
• Finding the \(k\) quickest simple paths in a network
• Parallel Merge Sort
• The quickest path problem
• A Method for the Solution of the N th Best Path Problem
• An efficient algorithm for K shortest simple paths
• An optimal algorithm for selection in a min-heap
• An optimally efficient selection algorithm
• CalculatingKth Shortest Paths

Cited In (4)

• The shortest path with at most / nodes in each of the series/parallel clusters
• Finding the \(k\) shortest paths in parallel
• Δ-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 Q5048947)