2 papers
math.CO2017
Approximating the Minimum -Section Width in Bounded-Degree Trees with Linear Diameter
Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz
Minimum -Section denotes the NP-hard problem to partition the vertex set of a graph into sets of sizes as equal as possible while minimizing the cut width, which is the numb…
math.CO2017
On Minimum Bisection and Related Cut Problems in Trees and Tree-Like Graphs
Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz
Minimum Bisection denotes the NP-hard problem to partition the vertex set of a graph into two sets of equal sizes while minimizing the width of the bisection, which is defined as t…