Finding an induced path that is not a shortest path
Eli Berger, Paul Seymour, Sophie Spirkl·2020-05-27·via math.CO updates on arXiv.org
We give a polynomial-time algorithm that, with input a graph $G$ and two vertices $u,v$ of $G$, decides whether there is an induced $uv$-path that is longer than the shortest $uv$-path.