arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1306.2578cs.DS
收藏

关于端子的小切口的说明

A note on small cuts for a terminal

Yixin Cao

摘要:

给定图$G = (V,E)$和终端$s\in V$,$s$的割$X$是包含$s$的顶点集。我们寻找在两种意义上小的切口,即,在$X$中不超过$k$顶点,并且不超过离开$X$的$t$边。通过回答Fomin等人提出的一个问题(arXiv:1304.6189),我们证明了该问题是由$k$或$t$参数化的固定参数可处理的。

英文摘要:

Given a graph $G = (V,E)$ and a terminal $s\in V$, a cut $X$ for $s$ is a vertex set that contains $s$. We look for a cut that is small in two senses, i.e., there are no more than $k$ vertices in $X$ and no more than $t$ edges leaving $X$. Answering a question asked by Fomin et al. (arXiv:1304.6189), we show the problem is fixed-parameter tractable parameterized by either $k$ or $t$.

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

↑