A Sidetrack-Based Algorithm for Finding the k Shortest Simple Paths in a Directed Graph
From MaRDI portal
Publication:4636533
DOI10.4230/LIPICS.ISAAC.2016.49zbMath1398.05202arXiv1601.02867OpenAlexW2962770773MaRDI QIDQ4636533
Publication date: 19 April 2018
Full work available at URL: https://arxiv.org/abs/1601.02867
Analysis of algorithms and problem complexity (68Q25) Enumeration in graph theory (05C30) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
This page was built for publication: A Sidetrack-Based Algorithm for Finding the k Shortest Simple Paths in a Directed Graph