Reachability for airline networks: fast algorithm for shortest path problem with time windows

DOI10.1016/J.TCS.2018.01.016zbMath1423.90262OpenAlexW2792638830MaRDI QIDQ1630997

Guihai Chen, Xiaotian You, Yaru Dang, Yueyang Xianzang, Xiaofeng Gao, Xing-Long Wang

Publication date: 5 December 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.01.016

zbMATH Keywords

reachabilitycomplex networkcentralityshortest path with time windows

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Minimum time paths in a network with mixed time constraints.
• Shortest path problems with left-side time windows
• Solving the \(k\)-shortest path problem with time windows in a time varying network
• The centrality index of a graph
• A faster algorithm for betweenness centrality*
• Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights
• Fibonacci heaps and their uses in improved network optimization algorithms
• Collective dynamics of ‘small-world’ networks

This page was built for publication: Reachability for airline networks: fast algorithm for shortest path problem with time windows