Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference17 articles.
1. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width;Călinescu;J. Algorithms,2003
2. S. Chawla, R. Krauthgamer, R. Kumar, Y. Rabani, D. Sivakumar, On the hardness of approximating multicut and sparsest-cut, in: Proceedings of the Computational Complexity Conference, 2005.
3. Hardness of cut problems in directed graphs;Chuzhoy,2006
4. Minimal multicut and maximal integer multiflow: a survey;Costa;Eur. J. Oper. Res.,2005
5. The complexity of multiterminal cuts;Dahlhaus;SIAM J. Comput.,1994
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献