Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference35 articles.
1. Bateni, M., Hajiaghayi, M., Klein, P.N., Mathieu, C.: A polynomial-time approximation scheme for planar multiway cut. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 639–655, (2012)
2. Bentz, C.: On the complexity of the multicut problem in bounded tree-width graphs and digraphs. Discret. Appl. Math. 156(10), 1908–1917 (2008)
3. Bentz, C.: A simple algorithm for multicuts in planar graphs with outer terminals. Discret. Appl. Math. 157, 1959–1964 (2009)
4. Bentz, C.: A polynomial-time algorithm for planar multicuts with few source-sink pairs. In: International Workshop on Parameterized and Exact Computation, pp. 109–119, (2012) Also in
arXiv:1206.3999
5. Bodlaender, H.: Dynamic programming on graphs with bounded treewidth. In: Proceedings of the 15th International Colloquium on Automata, Languages and Programming (ICALP), (1988)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献