Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference12 articles.
1. A simple algorithm for multicuts in planar graphs with outer terminals;Bentz;Discrete Applied Mathematics,2009
2. On the complexity of the multicut problem in bounded tree-width graphs and digraphs;Bentz;Discrete Applied Mathematics,2008
3. Chawla, S., R. Krauthgamer, R. Kumar, Y. Rabani and D. Sivakumar, On the hardness of approximating multicut and sparsest-cut, Proc. CCC (2005)
4. Efficient algorithms for k-terminal cuts on planar graphs;Chen;Algorithmica,2004
5. Chuzhoy, J., and S. Khanna, Hardness of cut problems in directed graphs, Proc. STOC (2006), 527–536
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献