最短路径重路由的复杂性
The Complexity of Rerouting Shortest Paths
摘要:
最短路径重构问题有一个图G(具有单位边长)作为输入,图G具有顶点s和t,以及两条最短st-路径P和Q。问题是是否存在一个从P开始到Q结束的最短st-路径序列,使得后续路径仅在一个顶点上不同。这被称为重路由序列。这个问题被证明是PSPACE完全的。对于无爪图和弦图,证明了该问题可以在多项式时间内求解,且最短重路由序列具有线性长度。对于这些类,它也表明,决定是否存在一个重路由序列之间的所有对最短ST路径可以在多项式时间。最后给出了一个计算孤立路数的多项式时间算法。
英文摘要:
The Shortest Path Reconfiguration problem has as input a graph G (with unit edge lengths) with vertices s and t, and two shortest st-paths P and Q. The question is whether there exists a sequence of shortest st-paths that starts with P and ends with Q, such that subsequent paths differ in only one vertex. This is called a rerouting sequence. This problem is shown to be PSPACE-complete. For claw-free graphs and chordal graphs, it is shown that the problem can be solved in polynomial time, and that shortest rerouting sequences have linear length. For these classes, it is also shown that deciding whether a rerouting sequence exists between all pairs of shortest st-paths can be done in polynomial time. Finally, a polynomial time algorithm for counting the number of isolated paths is given.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。