Finding the k shortest simple paths: time and space trade-offs
From MaRDI portal
Publication:6579778
DOI10.1145/3626567MaRDI QIDQ6579778FDOQ6579778
Authors: Ali Al Zoobi, David Coudert, Nicolas Nisse 
Publication date: 26 July 2024
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Cites Work
- Complex networks: structure and dynamics
- Finding the k Shortest Paths
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
- A new approach to all-pairs shortest paths on real-weighted graphs
- Finding the K Shortest Loopless Paths in a Network
- Title not available (Why is that?)
- Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
- Finding the k shortest simple paths
- Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems
- Finding the \(K\) shortest paths in a time-schedule network with constraints on arcs
- An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths
- An efficient algorithm for K shortest simple paths
- An efficient implementation of an algorithm for findingK shortest simple paths
- The pairing heap: A new form of self-adjusting heap
- Subcubic equivalences between path, matrix, and triangle problems
- Finding the \(K\) shortest paths in a schedule-based transit network
- On algorithms for finding the k shortest paths in a network
- Computing the N Best Loopless Paths in a Network
- A sidetrack-based algorithm for finding the \(k\) shortest simple paths in a directed graph
- \(k\)-best solutions of MSO problems on tree-decomposable graphs
- Finding \(k\) shortest simple paths in directed graphs: a node classification algorithm
This page was built for publication: Finding the \(k\) shortest simple paths: time and space trade-offs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579778)
