arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.12861math.CO
收藏

找到不是最短路径的诱导路径

Finding an induced path that is not a shortest path

Eli Berger, Paul Seymour, Sophie Spirkl

摘要:

我们给出了一个多项式时间算法,该算法以图$G$和$G$的两个顶点$u,v$为输入,判定是否存在一条比最短$uv$-路长的诱导$uv$-路.

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑