Finding an induced path that is not a shortest path
Loading...
Date
2021-07
Authors
Berger, Eli
Seymour, Paul
Spirkl, Sophie
Advisor
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier
Abstract
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.
Description
The 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/
Keywords
induced path, shortest path, algorithm