Shortest Journeys in Directed Temporal Graphs

DOI10.1142/s0129054123420030OpenAlexW4377943221MaRDI QIDQ6066460

Siu-Wing Cheng

Publication date: 16 November 2023

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054123420030

zbMATH Keywords

priority search treetemporal graphscontinuous Dijkstra paradigmshortest journey

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Temporal network optimization subject to connectivity constraints
• The Discrete Geodesic Problem
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• The weighted region problem
• SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
• Shortest paths on polyhedral surfaces and terrains
• Measuring Temporal Lags in Delay-Tolerant Networks
• Approximate Shortest Descending Paths
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
• Connectivity and inference problems for temporal networks

This page was built for publication: Shortest Journeys in Directed Temporal Graphs