Graph partitioning: an updated survey (Q6110873)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7721488

Language	Label	Description	Also known as
English	Graph partitioning: an updated survey	scientific article; zbMATH DE number 7721488

Statements

scholarly article

0 references

Graph partitioning: an updated survey (English)

0 references

0 references

0 references

AKCE International Journal of Graphs and Combinatorics

0 references

publication date

2 August 2023

0 references

zbMATH Keywords

digraph

0 references

partition

0 references

bisection

0 references

max-cut

0 references

MaRDI profile type

MaRDI publication profile

0 references

Bipartite subgraphs

0 references

Maximum directed cuts in acyclic digraphs

0 references

Maximum cuts and judicious partitions in graphs without short cycles

0 references

MaxCut in ${\bm H)$-Free Graphs

0 references

An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design

0 references

Max \(k\)-cut and judicious \(k\)-partitions

0 references

Judicious partitions of bounded‐degree graphs

0 references

0 references

Problems and results on judicious partitions

0 references

Judicious partitions of 3-uniform hypergraphs

0 references

Exact bounds for judicious partitions of graphs

0 references

Judicious partitions of hypergraphs

0 references

Cycles of even length in graphs

0 references

Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming

0 references

On Maximum Edge Cuts of Connected Digraphs

0 references

A discrete dynamic convexized method for VLSI circuit partitioning

0 references

Hypergraph cuts above the average

0 references

Geometry of cuts and metrics

0 references

Decomposing graphs with girth at least five under degree constraints

0 references

Some Extremal Properties of Bipartite Subgraphs

0 references

0 references

0 references

The size of the largest bipartite subgraphs

0 references

Bounds for pairs in judicious partitioning of graphs

0 references

Bisections of Graphs Without Short Cycles

0 references

A bound for judicious \(k\)-partitions of graphs

0 references

The RPR2 rounding technique for semidefinite programs

0 references

Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION

0 references

A linear hypergraph extension of the bipartite Turán problem

0 references

New results for MaxCut in H$H$‐free graphs

0 references

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

0 references

0 references

Some Network Flow Problems Solved with Pseudo-Boolean Programming

0 references

Star-critical Ramsey numbers for large generalized fans and books

0 references

Ramsey number of \(K_3\) versus \(F_{3, n}\)

0 references

The Bollobás-Thomason conjecture for \(3\)-uniform hypergraphs

0 references

Judicious partitions of uniform hypergraphs

0 references

Spectral extremal results for hypergraphs

0 references

On the \(\alpha \)-spectra of uniform hypergraphs and its associated graphs

0 references

Largest \(H\)-eigenvalue of uniform \(s\)-hypertrees

0 references

A homogeneous polynomial associated with general hypergraphs and its applications

0 references

On bipartitions of directed graphs with small semidegree

0 references

On partitions of \(K_{2, 3}\)-free graphs under degree constraints

0 references

A bound on judicious bipartitions of directed graphs

0 references

On judicious bipartitions of directed graphs

0 references

On bisections of graphs without complete bipartite graphs

0 references

Bipartitions of oriented graphs

0 references

On judicious partitions of uniform hypergraphs

0 references

On bisections of directed graphs

0 references

The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs

0 references

Max-bisections of \(H\)-free graphs

0 references

On a Problem of Judicious<i>k</i>-Partitions of Graphs

0 references

Judicious Partitioning of Hypergraphs with Edges of Size at Most 2

0 references

Bisections of graphs without \(K_{2, l}\)

0 references

On decomposition of triangle-free graphs under degree constraints

0 references

Bisections of graphs

0 references

Judicious partitions of directed graphs

0 references

Analytic connectivity of k-uniform hypergraphs

0 references

On generalized Folkman numbers

0 references

Discrete Relaxation Method for Triple Patterning Lithography Layout Decomposition

0 references

New upper bound for multicolor Ramsey number of odd cycles

0 references

A Folkman Linear Family

0 references

Sparse multipartite graphs as partition universal for graphs with bounded degree

0 references

Lower bounds for \(r_2(K_1 + G)\) and \(r_3(K_1 + G)\) from Paley graph and generalization

0 references

Ramsey Numbers Involving Large Books

0 references

Large Book-Cycle Ramsey Numbers

0 references

Maximum bisections of graphs without short even cycles

0 references

MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS

0 references

A discrete dynamic convexized method for the max-cut problem

0 references

An Efficient Memetic Algorithm for theMax-Bisection Problem

0 references

Class Ramsey numbers of odd cycles in many colors

0 references

On judicious partitions of graphs

0 references

Partitioning digraphs with outdegree at least 4

0 references

0 references

On tight components and anti-tight components

0 references

Decomposing <i>C</i><sub>4</sub>‐free graphs under degree constraints

0 references

On several partitioning problems of Bollobás and Scott

0 references

Bounds for pairs in partitions of graphs

0 references

Partitioning 3-uniform hypergraphs

0 references

On judicious bipartitions of graphs

0 references

Bipartite Subgraphs of Triangle-Free Graphs

0 references

On a bottleneck bipartition conjecture of Erdős

0 references

0 references

0 references

A note on bipartite subgraphs of triangle‐free graphs

0 references

Bipartite Ramsey numbers for graphs of small bandwidth

0 references

Judiciously 3‐partitioning 3‐uniform hypergraphs

0 references

0 references

Graph decomposition with constraints on the connectivity and minimum degree

0 references

Multicolor bipartite Ramsey numbers of \(K_{t, s}\) and large \(K_{n, n}\)

0 references

Partitioning dense uniform hypergraphs

0 references

On the Z-eigenvalues of the signless Laplacian tensor for an even uniform hypergraph

0 references

On the Z-eigenvalues of the adjacency tensors for uniform hypergraphs

0 references

H-eigenvalues of signless Laplacian tensor for an even uniform hypergraph

0 references

0 references

A note on balanced bipartitions

0 references

Balanced judicious bipartitions of graphs

0 references

Triangle-free subcubic graphs with minimum bipartite density

0 references

On a bipartition problem of Bollobás and Scott

0 references

Judicious \(k\)-partitions of graphs

0 references

Better Bounds for <i>k</i>-Partitions of Graphs

0 references

On judicious bisections of graphs

0 references

Node-and edge-deletion NP-complete problems

0 references

Ramsey numbers of large books and bipartite graphs with small bandwidth

0 references

BIPARTITE SUBGRAPHS OF -FREE GRAPHS

0 references

Biased partitions and judicious \(k\)-partitions of graphs

0 references

Maximum cuts of graphs with forbidden cycles

0 references

A generalization of Stiebitz-type results on graph decomposition

0 references

Spectral radius of \(r\)-uniform supertrees with perfect matchings

0 references

On judicious partitions of hypergraphs with edges of size at most 3

0 references

Bipartite density of triangle-free subcubic graphs

0 references

Speeding up a memetic algorithm for the max-bisection problem

0 references

Identifiers

zbMATH Open document ID

0 references

10.1080/09728600.2022.2148589

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6110873

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6110873&oldid=37548046"