Efficiently Listing Bounded Length st-Paths

DOI10.1007/978-3-319-19315-1_28zbMath1401.68256arXiv1411.6852OpenAlexW1525471909MaRDI QIDQ2946068

Gustavo Sacomoto, Marie-France Sagot, Romeo Rizzi

Publication date: 15 September 2015

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

Full work available at URL: https://arxiv.org/abs/1411.6852

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Computing and listing \(st\)-paths in public transportation networks ⋮ An exact two-phase approach to re-optimize tours in home care planning ⋮ Computing and Listing st-Paths in Public Transportation Networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On generating all maximal independent sets
• The k most vital arcs in the shortest path problem
• Amortized $\tilde{O}(|V|)$ -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs
• Faster algorithms for the shortest path problem
• Generalized best-first search strategies and the optimality of A*
• An efficient algorithm for K shortest simple paths
• Efficient Algorithms for Shortest Paths in Sparse Networks
• Finding the k Shortest Paths
• An Appraisal of Some Shortest-Path Algorithms
• Finding the K Shortest Loopless Paths in a Network
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
• Automata, Languages and Programming
• Optimal Listing of Cycles and st-Paths in Undirected Graphs

This page was built for publication: Efficiently Listing Bounded Length st-Paths