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.
Bibliographical notePublisher Copyright:
© 2021 Elsevier B.V.
- Induced path
- Shortest path
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics