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.
Original language | English |
---|---|
Article number | 112398 |
Journal | Discrete Mathematics |
Volume | 344 |
Issue number | 7 |
DOIs | |
State | Published - Jul 2021 |
Bibliographical note
Publisher Copyright:© 2021 Elsevier B.V.
Keywords
- Algorithm
- Induced path
- Shortest path
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics