Multicut Algorithms via Tree Decompositions

DOI10.1007/978-3-642-13073-1_16zbMath1284.68303OpenAlexW1504436682MaRDI QIDQ3563001

Stefan Woltran, Reinhard Pichler, Stefan Rümmele

Publication date: 28 May 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.165.8948

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Constrained coalition formation on valuation structures: formal framework, applications, and islands of tractability ⋮ Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth

This page was built for publication: Multicut Algorithms via Tree Decompositions