Connection Scan Algorithm
From MaRDI portal
Recommendations
- Connection scan accelerated
- Connectivity algorithms
- Performance analysis and comparison of algorithms for measures of network connectivity
- scientific article; zbMATH DE number 517070
- An optimal parallel connectivity algorithm
- GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS(<Special Issue>Network Design, Control and Optimization)
- On the diagnosing algorithm for networks
- An efficient algorithm for determining the connectivity of complex undirected networks
- Network differential connectivity analysis
Cites work
- scientific article; zbMATH DE number 2084318 (Why is no real title available?)
- scientific article; zbMATH DE number 1099195 (Why is no real title available?)
- scientific article; zbMATH DE number 1926659 (Why is no real title available?)
- scientific article; zbMATH DE number 1848402 (Why is no real title available?)
- scientific article; zbMATH DE number 7121837 (Why is no real title available?)
- A note on two problems in connexion with graphs
- Accelerating time-dependent multi-criteria timetable information is harder than expected
- Connection scan accelerated
- Delay-robustness of transfer patterns in public transportation route planning
- Dijkstra's algorithm on-line
- Efficient Timetable Information in the Presence of Delays
- Efficient models for timetable information in public transportation systems
- Engineering multilevel overlay graphs for shortest-path queries
- Fast routing in very large public transportation networks using transfer patterns
- Intriguingly simple and fast transit routing
- Is timetabling routing always reliable for public transport?
- Parallel computation of best connections in public transportation networks
- Paying less for train connections with MOTIS
- Recoverable robust timetable information
- Robust routing in urban public transportation: how to find reliable journeys based on past observations
- Round-Based Public Transit Routing
- Scalable transfer patterns
- Stochastic delay prediction in large train networks
- The price of robustness in timetable information
- Trip-based public transit routing
Cited in
(10)- On computing Pareto optimal paths in weighted time-dependent networks
- Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks
- scientific article; zbMATH DE number 517070 (Why is no real title available?)
- Connection scan accelerated
- Intriguingly simple and fast transit routing
- On computing optimal temporal branchings and spanning subgraphs
- Temporal matching on geometric graph data
- scientific article; zbMATH DE number 7525451 (Why is no real title available?)
- Foremost non-stop journey arrival in linear time
- On computing optimal temporal branchings
This page was built for publication: Connection Scan Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4629533)
