@article{037f0bb127534253a3aec588425cc334,
title = "Finding an induced path that is not a shortest path",
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.",
keywords = "Algorithm, Induced path, Shortest path",
author = "Eli Berger and Paul Seymour and Sophie Spirkl",
note = "Funding Information: Supported by Israel Science Foundation Grant 100004639 and Binational Science Foundation USA–Israel Grant 100005728.Supported by Air Force Office of Scientific Research, United States grant A9550-19-1-0187 and NSF, United States grant DMS-1800053.This material is based upon work supported by the National Science Foundation, United States under Award No. DMS-1802201. Publisher Copyright: {\textcopyright} 2021 Elsevier B.V.",
year = "2021",
month = jul,
doi = "10.1016/j.disc.2021.112398",
language = "English (US)",
volume = "344",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "7",
}