On short fastest paths in temporal graphs

DOI10.1007/978-3-030-68211-8_4OpenAlexW3131449087MaRDI QIDQ2232230

M. Srikanth, G. Ramakrishna, Umesh Sandeep Danda, Jens M. Schmidt

Publication date: 4 October 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-68211-8_4

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Traveling salesman problems in temporal graphs
• An almost optimal algorithm for unbounded searching
• Temporal network optimization subject to connectivity constraints
• The complexity of finding small separators in temporal graphs
• Intriguingly Simple and Fast Transit Routing
• DMVP: Foremost Waypoint Coverage of Time-Varying Graphs
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
• Connectivity and inference problems for temporal networks

This page was built for publication: On short fastest paths in temporal graphs