Multicut in trees viewed through the eyes of vertex cover-Reference-Cited by-同舟云学术

Multicut in trees viewed through the eyes of vertex cover

Published:2012-09 Issue:5 Volume:78 Page:1637-1650
ISSN:0022-0000
Container-title:Journal of Computer and System Sciences
language:en
Short-container-title:Journal of Computer and System Sciences

Author:

Chen Jianer,Fan Jia-Hao,Kanj Iyad,Liu Yang,Zhang Fenghui

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference14 articles.

1. F.A. Abu-Khzam, R. Collins, M. Fellows, M. Langston, W. Suters, C. Symons, Kernelization algorithms for the vertex cover problem: Theory and experiments, in: Proceedings of 6th Workshop on Algorithm Engineering and Experiments, 2004, pp. 62–69.

2. N. Bousquet, J. Daligault, S. Thomassé, Multicut is FPT, in: STOC, 2011, pp. 459–468.

3. N. Bousquet, J. Daligault, S. Thomassé, A. Yeo, A polynomial kernel for multicut in trees, in: Proceedings of the 26th Symposium on Theoretical Aspects of Computer Science, 2009, pp. 183–194.

4. Nondeterminism within P;Buss;SIAM J. Comput.,1993

5. Minimal multicut and maximal integer multiflow: A survey;Costa;European J. Oper. Res.,2005

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parameterized complexity of multicut in weighted trees;Theoretical Computer Science;2023-11

2. Parameterized Complexity of Weighted Multicut in Trees;Graph-Theoretic Concepts in Computer Science;2022

3. Parameterized complexity and approximation issues for the colorful components problems;Theoretical Computer Science;2018-08

4. Multicut Is FPT;SIAM Journal on Computing;2018-01

5. Parameterized complexity dichotomy for Steiner Multicut;Journal of Computer and System Sciences;2016-09