On minimum vertex bisection of random d-regular graphs

Cites Work

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

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)