On the parameterized complexity of separating certain sources from the target.

Theoretical Computer Science(2019)

引用 2|浏览25
暂无评分
摘要
multicut is proven to be FPT parameterized by the size of the cutset p. We focus on its generalization partial multicut setting the number of pairs of terminals to be separated as a parameter r: it asks for the minimum edge/vertex cut whose removal would separate r sources si from their target ti. Our main contributions concern its single target subproblem, partial one-target cut (potc).
更多
查看译文
关键词
Multicut,Fixed-parameter tractability,W[1]-hardness
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要