Computing and Listing st-Paths in Public Transportation Networks

DOI10.1007/978-3-319-34171-2_8zbMath1385.68058OpenAlexW2484701167MaRDI QIDQ5740180

Marie-France Sagot, Gustavo Sacomoto, Matúš Mihalák, Kateřina Böhmová, Tobias Pröger

Publication date: 25 July 2016

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-34171-2_8

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Computing and listing \(st\)-paths in public transportation networks ⋮ Sequence Hypergraphs ⋮ Sequence Hypergraphs: Paths, Flows, and Cuts

Uses Software

• Algorithm 360

Cites Work

• A note on two problems in connexion with graphs
• On generating all maximal independent sets
• 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
• Analytical approach to parallel repetition
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing and Listing st-Paths in Public Transportation Networks