Bounds on the max and min bisection of random cubic and random 4-regular graphs
type: Item
instance of: scholarly article
title: Bounds on the max and min bisection of random cubic and random 4-regular graphs
zbMATH Open document ID: 1070.68119
DOI: 10.1016/S0304-3975(03)00236-6
author: Nicholas Wormald
author: J. Díaz
author: Norman Do
author: Maria Serna
published in: Theoretical Computer Science
publication date: 2004-10-27T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 2111118
MaRDI profile type: Publication
cites work: Q4234075
cites work: Q2766666
cites work: The isoperimetric number of random regular graphs
cites work: Q3682518
cites work: Q4440432
cites work: A Polylogarithmic Approximation of the Minimum Bisection
cites work: Q4535020
cites work: A note on approximating Max-Bisection on regular graphs
cites work: Q3877805
cites work: Q4198056
cites work: Q2762518
cites work: Q4654270
cites work: Q4027167
cites work: Q4519896
cites work: Q4779170
cites work: Q4938890
cites work: Q4263664
cites work: Analysis of greedy algorithms on graphs with bounded degrees
Recommended article: On the minimum bisection of random 3-regular graphs
Recommended article: Bounds on the bisection width for random \(d\)-regular graphs
Recommended article: Q4440432
Recommended article: Q4779170
Recommended article: Upper bounds on the bisection width of 3- and 4-regular graphs
Recommended article: Q3789609
Recommended article: Q4027167
Recommended article: Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs
Recommended article: The maximum and minimum degrees of random bipartite multigraphs
description: scientific article; zbMATH DE number 2111118