Abstract
Several variants of Multicut problems arise in applications like circuit and network design. In general, these problems are NP-complete. The goal of our work is to investigate the potential of clique-width for identifying tractable fragments of Multicut. We show for several parameterizations involving clique-width whether they lead to tractability or not. Since bounded tree-width implies bounded clique-width, our tractability results extend previous results via tree-width, in particular to dense graphs. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Lackner, M., Pichler, R., Rümmele, S., & Woltran, S. (2012). Multicut on graphs of bounded clique-width. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7402 LNCS, pp. 115–126). https://doi.org/10.1007/978-3-642-31770-5_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
