Bounds on the max and min bisection of random cubic and random 4-regular graphs

This publication has 8 references indexed in Scilit:

• Analysis of greedy algorithms on graphs with bounded degrees
  Discrete Mathematics, 2003
• A survey of graph layout problems
  ACM Computing Surveys, 2002
• A note on approximating Max-Bisection on regular graphs
  Information Processing Letters, 2001
• Models of Random Regular Graphs
  Published by Cambridge University Press (CUP) ,1999
• Polynomial time approximation schemes for dense instances of NP-hard problems
  Published by Association for Computing Machinery (ACM) ,1995
• The Isoperimetric Number of Random Regular Graphs
  European Journal of Combinatorics, 1988
• Graph bisection algorithms with good average case behavior
  Combinatorica, 1987
• A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory
  Czechoslovak Mathematical Journal, 1975