Computing and listing \(st\)-paths in public transportation networks
DOI10.1007/s00224-016-9747-4zbMath1393.68194OpenAlexW2569797005MaRDI QIDQ1635813
Gustavo Sacomoto, Luca Häfliger, Marie-France Sagot, Tobias Pröger, Kateřina Böhmová, Matúš Mihalák
Publication date: 1 June 2018
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-016-9747-4
Analysis of algorithms (68W40) Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- On generating all maximal independent sets
- Finding the \(K\) shortest paths in a schedule-based transit network
- Implicit Enumeration of Hyperpaths in a Logit Model for Transit Networks
- Efficiently Listing Bounded Length st-Paths
- An efficient algorithm for K shortest simple paths
- Finding the k Shortest Paths
- Finding All the Elementary Circuits of a Directed Graph
- Fibonacci heaps and their uses in improved network optimization algorithms
- Analytical approach to parallel repetition
- Is Timetabling Routing Always Reliable for Public Transportl
- 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
- Computing and Listing st-Paths in Public Transportation Networks
- Optimal Listing of Cycles and st-Paths in Undirected Graphs
This page was built for publication: Computing and listing \(st\)-paths in public transportation networks
