{
  "id": "2005.12861",
  "version": "v1",
  "published": "2020-05-26T16:44:28.000Z",
  "updated": "2020-05-26T16:44:28.000Z",
  "title": "Finding an induced path that is not a shortest path",
  "authors": [
    "Eli Berger",
    "Paul Seymour",
    "Sophie Spirkl"
  ],
  "categories": [
    "math.CO"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2020-05-26T16:44:28.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "shortest path",
      "induced path",
      "polynomial-time algorithm"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}