A note on balanced bipartitions
From MaRDI portal
Publication:709305
DOI10.1016/J.DISC.2010.03.029zbMath1219.05147OpenAlexW1969017638MaRDI QIDQ709305
Xingxing Yu, Juan Yan, Bao-Gang Xu
Publication date: 18 October 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.03.029
Related Items (16)
On judicious partitions of graphs ⋮ Judicious partitions of weighted hypergraphs ⋮ Biased partitions and judicious \(k\)-partitions of graphs ⋮ Maximum bisections of graphs without cycles of length 4 ⋮ On bisections of graphs without complete bipartite graphs ⋮ On judicious bisections of graphs ⋮ Upper bounds on minimum balanced bipartitions ⋮ Graph partitioning: an updated survey ⋮ Bisections of Graphs Without Short Cycles ⋮ Maximum bisections of graphs without short even cycles ⋮ Bisections of graphs without \(K_{2, l}\) ⋮ Bounds for judicious balanced bipartitions of graphs ⋮ On minimum balanced bipartitions of triangle-free graphs ⋮ An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance ⋮ Bipartition of graph under degree constraints ⋮ On bisections of directed graphs
Cites Work
- Judicious \(k\)-partitions of graphs
- On a bottleneck bipartition conjecture of Erdős
- Judicious partitions of graphs
- Exact bounds for judicious partitions of graphs
- On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation
- Judicious partitions of bounded‐degree graphs
- Problems and results on judicious partitions
- Balanced judicious bipartitions of graphs
- Maximum matching and a polyhedron with 0,1-vertices
- Some Extremal Properties of Bipartite Subgraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A note on balanced bipartitions
