k-shortest simple paths in bounded treewidth graphs
Authors:
- David CoudertDCDavid Coudert
- Andrea D'AScenzoADAndrea D'AScenzo
- Clément RambaudCRClément Rambaud
Open Access
- 17 March 2025
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 1039
Abstract
No abstract availableFunding Information
- Ministero dell’Istruzione, dell’Università e della Ricerca (2022TS4Y3N)
- Agence Nationale de la Recherche (ANR-15-IDEX-0001, ANR-19-CE48-0013)
- Università degli Studi dell'Aquila
- Université Côte d’Azur
This publication has 13 references indexed in Scilit:
- Top-k Distance Queries on Large Time-Evolving GraphsIEEE Access, 2023
- Finding k shortest simple paths in directed graphs: A node classification algorithmNetworks, 2014
- Improved algorithms for the k simple shortest paths and the replacement paths problemsInformation Processing Letters, 2009
- Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth Two1Algorithmica, 2001
- A partial k-arboretum of graphs with bounded treewidthTheoretical Computer Science, 1998
- Finding the k Shortest PathsSIAM Journal on Computing, 1998
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small TreewidthSIAM Journal on Computing, 1996
- An efficient algorithm for K shortest simple pathsNetworks, 1982
- Characterizations of outerplanar graphsDiscrete Mathematics, 1979
- Computing the N Best Loopless Paths in a NetworkJournal of the Society for Industrial and Applied Mathematics, 1963