On minimum bisection and related partition problems in graphs with bounded tree width

DOI10.1016/j.endm.2015.06.067zbMath1346.05229OpenAlexW2173278659MaRDI QIDQ322301

Tina Janne Schmidt, Cristina G. Fernandes, Anusch Taraz

Publication date: 14 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.06.067

zbMATH Keywords

tree decompositionminimum \(k\)-sectionminimum bisection

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)

Cites Work

• Approximating minimum \(k\)-section in trees with linear diameter
• Laplace eigenvalues of graphs---a survey
• Balanced graph partitioning
• Some simplified NP-complete graph problems
• How Good is Recursive Bisection?
• Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item