Canadian Traveler Problems in Temporal Graphs

Download PDF
Open Webpage

Thomas Bellitto, Johanne Cohen, Bruno Escoffier, Minh-Hang Nguyen, Mikaël Rabie

Published: 01 Jan 2026, Last Modified: 01 May 2026CrossrefEveryoneRevisionsCC BY-SA 4.0
Abstract: We study the Canadian Traveler Problem (CTP), where a traveler aims to travel from a vertex s to a vertex t in a network containing up to k potentially blocked edges. These blocked edges remain unknown until the traveler visits one of their endpoints. We investigate this problem in temporal graphs where edges are only accessible at specific times. We study classical variants of the shortest path problem in temporal graphs.