Graph partitioning: an updated survey

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items

Optimal bisections of directed graphs

Cites Work

On Maximum Edge Cuts of Connected Digraphs
The RPR2 rounding technique for semidefinite programs
Some Extremal Properties of Bipartite Subgraphs
MaxCut in ${\bm H)$-Free Graphs
Ramsey Numbers Involving Large Books
Large Book-Cycle Ramsey Numbers
Geometry of cuts and metrics
On judicious bipartitions of graphs
Partitioning digraphs with outdegree at least 4
On bisections of graphs without complete bipartite graphs
New results for MaxCut in H$H$‐free graphs
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
On judicious partitions of uniform hypergraphs
On judicious partitions of graphs
Multicolor bipartite Ramsey numbers of $K_{t, s}$ and large $K_{n, n}$
Lower bounds for $r_2(K_1 + G)$ and $r_3(K_1 + G)$ from Paley graph and generalization
On judicious bisections of graphs
Bisections of graphs
A bound for judicious $k$-partitions of graphs
Judicious partitions of uniform hypergraphs
On generalized Folkman numbers
On several partitioning problems of Bollobás and Scott
On a bipartition problem of Bollobás and Scott
Improved approximation algorithms for MAX $k$-cut and MAX BISECTION
A note on balanced bipartitions
Largest $H$-eigenvalue of uniform $s$-hypertrees
Bipartitions of oriented graphs
Partitioning 3-uniform hypergraphs
On tight components and anti-tight components
Bounds for pairs in partitions of graphs
Max $k$-cut and judicious $k$-partitions
Judicious $k$-partitions of graphs
Bipartite density of triangle-free subcubic graphs
On a bottleneck bipartition conjecture of Erdős
Judicious partitions of hypergraphs
The size of the largest bipartite subgraphs
Maximum cuts and judicious partitions in graphs without short cycles
New upper bound for multicolor Ramsey number of odd cycles
Ramsey number of $K_3$ versus $F_{3, n}$
Partitioning dense uniform hypergraphs
Spectral radius of $r$-uniform supertrees with perfect matchings
Bisections of graphs without $K_{2, l}$
Sparse multipartite graphs as partition universal for graphs with bounded degree
Bipartite Ramsey numbers for graphs of small bandwidth
A discrete dynamic convexized method for the max-cut problem
On partitions of $K_{2, 3}$-free graphs under degree constraints
Star-critical Ramsey numbers for large generalized fans and books
Cycles of even length in graphs
H-eigenvalues of signless Laplacian tensor for an even uniform hypergraph
Judicious partitions of 3-uniform hypergraphs
Exact bounds for judicious partitions of graphs
On bipartitions of directed graphs with small semidegree
Ramsey numbers of large books and bipartite graphs with small bandwidth
A generalization of Stiebitz-type results on graph decomposition
Spectral extremal results for hypergraphs
On judicious bipartitions of directed graphs
A homogeneous polynomial associated with general hypergraphs and its applications
On the $\alpha $-spectra of uniform hypergraphs and its associated graphs
A linear hypergraph extension of the bipartite Turán problem
Maximum bisections of graphs without short even cycles
Max-bisections of $H$-free graphs
Class Ramsey numbers of odd cycles in many colors
A bound on judicious bipartitions of directed graphs
Hypergraph cuts above the average
On judicious partitions of hypergraphs with edges of size at most 3
Speeding up a memetic algorithm for the max-bisection problem
On bisections of directed graphs
On the Z-eigenvalues of the adjacency tensors for uniform hypergraphs
The Bollobás-Thomason conjecture for $3$-uniform hypergraphs
Triangle-free subcubic graphs with minimum bipartite density
Bipartite subgraphs
Biased partitions and judicious $k$-partitions of graphs
A discrete dynamic convexized method for VLSI circuit partitioning
On the Z-eigenvalues of the signless Laplacian tensor for an even uniform hypergraph
Bounds for pairs in judicious partitioning of graphs
Analytic connectivity of k-uniform hypergraphs
Discrete Relaxation Method for Triple Patterning Lithography Layout Decomposition
Maximum directed cuts in acyclic digraphs
A Folkman Linear Family
Judicious partitions of directed graphs
Graph decomposition with constraints on the connectivity and minimum degree
An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
A note on bipartite subgraphs of triangle‐free graphs
Bipartite Subgraphs of Triangle-Free Graphs
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
On decomposition of triangle-free graphs under degree constraints
Judicious partitions of bounded‐degree graphs
Bisections of Graphs Without Short Cycles
The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs
Maximum cuts of graphs with forbidden cycles
Problems and results on judicious partitions
Decomposing graphs with girth at least five under degree constraints
MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS
BIPARTITE SUBGRAPHS OF -FREE GRAPHS
On a Problem of Judiciousk-Partitions of Graphs
Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming
Judiciously 3‐partitioning 3‐uniform hypergraphs
Balanced judicious bipartitions of graphs
Better Bounds for k-Partitions of Graphs
An Efficient Memetic Algorithm for theMax-Bisection Problem
Some Network Flow Problems Solved with Pseudo-Boolean Programming
Judicious Partitioning of Hypergraphs with Edges of Size at Most 2
Decomposing C₄‐free graphs under degree constraints
Node-and edge-deletion NP-complete problems