Berger, EliSeymour, PaulSpirkl, Sophie2022-08-122022-08-122021-07https://doi.org/10.1016/j.disc.2021.112398http://hdl.handle.net/10012/18523The final publication is available at Elsevier via https://doi.org/10.1016/j.disc.2021.112398. © 2021. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/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.enAttribution-NonCommercial-NoDerivatives 4.0 Internationalhttp://creativecommons.org/licenses/by-nc-nd/4.0/induced pathshortest pathalgorithmArticle