Bipartitioning of random graphs of fixed extensive valence

Abstract
The procedure of Fu and Anderson (ibid., vol.19, p.1605, 1986) for the application of statistical mechanics to the problem of bipartitioning random graphs is extended to graphs of fixed extensive valence. The cost function is shown to be independent of whether the valence is locally or globally constrained.

This publication has 3 references indexed in Scilit: