On minimum vertex bisection of random d-regular graphs

Cites work

A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
An \(\mathcal{O}(n^4)\) time algorithm to compute the bisection width of solid grid graphs
An Efficient Heuristic Procedure for Partitioning Graphs
Bounds on the bisection width for random \(d\)-regular graphs
Bounds on the max and min bisection of random cubic and random 4-regular graphs
Exact combinatorial branch-and-bound for graph bisection
Factors of IID on trees
Graph partitioning
scientific article; zbMATH DE number 5485537 (Why is no real title available?)
scientific article; zbMATH DE number 1342092 (Why is no real title available?)
scientific article; zbMATH DE number 1405894 (Why is no real title available?)
scientific article; zbMATH DE number 6783408 (Why is no real title available?)
LINEAR LAYOUT OF GENERALIZED HYPERCUBES
Lower bounds for the isoperimetric numbers of random regular graphs
Minimum bisection is NP-hard on unit disk graphs
On the bipartition of graphs
On the Edge-Expansion of Graphs
On the parameterized complexity of computing balanced partitions in graphs
Optimal Assignments of Numbers to Vertices
Optimal numberings and isoperimetric problems on graphs
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
Solutions of ordinary differential equations as limits of pure jump markov processes
Some simplified NP-complete graph problems
The asymptotic number of labeled graphs with given degree sequences
The bisection width of cubic graphs
The cook-book approach to the differential equation method
The diameter of random regular graphs
The isoperimetric number of random regular graphs
Uniform generation of random regular graphs
Vertex Bisection is Hard, too

This page was built for publication: On minimum vertex bisection of random \(d\)-regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564623)