Multi-multiway cut problem on graphs of bounded branch width

DOI10.1007/978-3-642-38756-2_32MaRDI QIDQ5405943zbMATH OpenOpenAlexFDO

Authors Xiaojie Deng, Bingkai Lin, Chihao Zhang

Publication date 3 April 2014

Published in Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38756-2_32

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Connectivity (05C40)

Recommendations

• On the complexity of the multicut problem in bounded tree-width graphs and digraphs
• Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
• On the generalized multiway cut in trees problem
• scientific article; zbMATH DE number 1187148
• On the generalized multiway cut in trees problem

Cited in

(9)

• Temporal separators with deadlines
• The multi-terminal vertex separator problem: branch-and-cut-and-price
• Isolation branching: a branch and bound algorithm for the \(k \)-terminal cut problem
• Generalized \(k\)-multiway cut problems
• On the complexity of the multicut problem in bounded tree-width graphs and digraphs
• Complexity framework for forbidden subgraphs. I: The framework
• Close relatives of feedback vertex set without single-exponential algorithms parameterized by treewidth
• Linear Time Algorithms for Happy Vertex Coloring Problems for Trees
• scientific article; zbMATH DE number 1187148 (Why is no real title available?)

This page was built for publication: Multi-multiway cut problem on graphs of bounded branch width

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