arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1407.7498cs.DScs.CR
收藏

具有线性序终端的有向多割

Directed Multicut with linearly ordered terminals

Robert F. Erbacher, Trent Jaeger, Nirupama Talele, Jason Teutsch

摘要:

受网络安全中的应用的启发,我们研究了以下定向多割的“线性”情况。设$G$是一个有向图,它包含若干个不同的顶点$t_1, \ldots, t_k$ .对于所有$i < j$,消除从$t_i$到$t_j$的所有路径的最小边切割的大小是多少?我们发现,这个问题是固定参数易处理时,通过运行在$O(4^p p n^4)$时间的算法参数化的割集大小$p$。

英文摘要:

Motivated by an application in network security, we investigate the following "linear" case of Directed Mutlicut. Let $G$ be a directed graph which includes some distinguished vertices $t_1, \ldots, t_k$. What is the size of the smallest edge cut which eliminates all paths from $t_i$ to $t_j$ for all $i < j$? We show that this problem is fixed-parameter tractable when parametrized in the cutset size $p$ via an algorithm running in $O(4^p p n^4)$ time.

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

↑