论文标题
找到不是最短路径的诱导路径
Finding an induced path that is not a shortest path
论文作者
论文摘要
我们给出了一个多项式时间算法，该算法使用输入$ g $和两个顶点$ u，v $ $ g $，决定是否有一个诱导的$ uv $ - uv $ - 比最短的$ uv $ path。
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.
