Simpler and faster algorithms for detours in planar digraphs

Meike Hatzel, Konrad Majewski, Michał Pilipczuk +1

In the directed detour problem one is given a digraph $G$ and a pair of vertices $s$ and~$t$, and the task is to decide whether there is a directed simple path from $s$ to $t$ in $…