Finding the k shortest simple paths: time and space trade-offs
From MaRDI portal
Publication:6579778
Cites work
- scientific article; zbMATH DE number 2065615 (Why is no real title available?)
- 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
- A sidetrack-based algorithm for finding the \(k\) shortest simple paths in a directed graph
- An O(n^3 n / ^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
- Complex networks: structure and dynamics
- Computing the N Best Loopless Paths in a Network
- Finding \(k\) shortest simple paths in directed graphs: a node classification algorithm
- Finding the k shortest simple paths
- Finding the K Shortest Loopless Paths in a Network
- Finding the \(K\) shortest paths in a schedule-based transit network
- Finding the K shortest paths in a time-schedule network with constraints on arcs
- Finding the k Shortest Paths
- Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
- Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems
- On algorithms for finding the k shortest paths in a network
- Subcubic equivalences between path, matrix, and triangle problems
- The pairing heap: A new form of self-adjusting heap
- \(k\)-best solutions of MSO problems on tree-decomposable graphs
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)
