Judicious partitions of weighted hypergraphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3510345 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- A note on balanced bipartitions
- Balanced judicious bipartitions of graphs
- Better bounds for \(k\)-partitions of graphs
- Exact bounds for judicious partitions of graphs
- Judicious \(k\)-partitions of graphs
- Judicious partitions and related problems
- Judicious partitions of 3-uniform hypergraphs
- Judicious partitions of bounded‐degree graphs
- Judicious partitions of graphs
- On a bottleneck bipartition conjecture of Erdős
- On judicious bisections of graphs
- On several partitioning problems of Bollobás and Scott
- Problems and results on judicious partitions
- Reducibility among combinatorial problems
- Some Extremal Properties of Bipartite Subgraphs
- The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs
Cited in
(6)- Bounds for the number of meeting edges in graph partitioning.
- scientific article; zbMATH DE number 2154974 (Why is no real title available?)
- Judicious bisection of hypergraphs
- \(M\)-partitions: optimal partitions of weight for one scale pan
- scientific article; zbMATH DE number 4195959 (Why is no real title available?)
- A note on judicious bisections of graphs
This page was built for publication: Judicious partitions of weighted hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q295108)