Multicut on graphs of bounded clique-width

DOI10.1007/978-3-642-31770-5_11MaRDI QIDQ3167354zbMATH OpenOpenAlexFDO

Authors Martin Lackner, Reinhard Pichler, Stefan Rümmele, Stefan Woltran

Publication date 2 November 2012

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31770-5_11

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Multicut algorithms via tree decompositions
• On the complexity of the multicut problem in bounded tree-width graphs and digraphs
• scientific article; zbMATH DE number 1187148
• SOFSEM 2006: Theory and Practice of Computer Science
• Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width

Cited in

(8)

• On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets
• Clique-width and edge contraction
• Multicut algorithms via tree decompositions
• scientific article; zbMATH DE number 1187148 (Why is no real title available?)
• Multi-clique-width
• The behavior of clique-width under graph operations and graph transformations
• Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs.
• On the complexity of the multicut problem in bounded tree-width graphs and digraphs

This page was built for publication: Multicut on graphs of bounded clique-width

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3167354)