Finding an induced path that is not a shortest path

Eli Berger, Paul Seymour, Sophie Spirkl

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Article number112398
JournalDiscrete Mathematics
Issue number7
StatePublished - Jul 2021

Bibliographical 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:
© 2021 Elsevier B.V.


  • Algorithm
  • Induced path
  • Shortest path

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Finding an induced path that is not a shortest path'. Together they form a unique fingerprint.

Cite this