Faster Detours in Undirected Graphs

Shyan Akmal, Virginia Vassilevska Williams, Ryan Williams +1

The $k$-Detour problem is a basic path-finding problem: given a graph $G$ on $n$ vertices, with specified nodes $s$ and $t$, and a positive integer $k$, the goal is to determine if…