arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2002.07799cs.DS
收藏

Tracking路径问题的多项式时间算法

Polynomial Time Algorithms for Tracking Path Problems

Pratibha Choudhary

摘要:

给定一个图$G$,以及终端顶点$s$和$t$,跟踪路径问题要求计算被标记为跟踪器的顶点的最小数量,使得在每个s-t路径中遇到的跟踪器序列是唯一的。跟踪路径在有向图和无向图中一般都是NP-难的。在本文中,我们给出了一个多项式时间算法的一些限制版本的跟踪路径。证明了弦图和竞赛图的跟踪路径是多项式时间可解的。证明了最大度为$δ\geq 6$的图的跟踪路径是NP-难的,并给出了一个$2(δ+1)$ -近似算法.我们还分析了版本的跟踪s-t路径的路径跟踪使用边而不是顶点,我们给出了一个多项式时间算法相同。最后,我们展示了如何重建的S-T路径,给定一个序列的跟踪器和跟踪集的图形考虑。

英文摘要:

Given a graph $G$, and terminal vertices $s$ and $t$, the TRACKING PATHS problem asks to compute a minimum number of vertices to be marked as trackers, such that the sequence of trackers encountered in each s-t path is unique. TRACKING PATHS is NP-hard in both directed and undirected graphs in general. In this paper we give a collection of polynomial time algorithms for some restricted versions of TRACKING PATHS. We prove that TRACKING PATHS is polynomial time solvable for chordal graphs and tournament graphs. We prove that TRACKING PATHS is NP-hard in graphs with bounded maximum degree $δ\geq 6$, and give a $2(δ+1)$-approximate algorithm for the same. We also analyze the version of tracking s-t paths where paths are tracked using edges instead of vertices, and we give a polynomial time algorithm for the same. Finally, we show how to reconstruct an s-t path, given a sequence of trackers and a tracking set for the graph in consideration.

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

↑