Local minima in the graph bipartitioning problem Page 1 Local minima in the graph bipartitioning
problem To cite this article: B. Krakhofer and PF Stadler 1996 EPL 34 85 View the article online …

Correlation Structure of the Landscape of the Graph-Bipartitioning-Problem Page 1 Correlation
Structure of the Landscape of the Graph-Bipartitioning-Problem By Peter F. Stadlera;b;y and …

Using techniques of the statistical mechanics of random systems, we present the replica-
symmetric solution of the graph-bipartitioning problem. We demonstrate that, in the graph …

We analyze graphs in which each vertex is assigned random coordinates in a geometric
space of arbitrary dimensionality and only edges between adjacent points are present. The …

The author presents the replica symmetric solution of the graph bipartitioning problem. He
points out the possibility of many solutions, even with the replica symmetry assumption. He …

The problem of bipartitioning a random graph of fixed finite local valence (connectivity) so as
to minimise the number of cross edges is studied by the application of Monte Carlo …

The mincut graph bisection problem involves partitioning the n vertices of a graph into
disjoint subsets, each containing exactly n/2 vertices, while minimizing the number of “cut” …

Replica-symmetric solutions of the graph-bipartitioning problem with finite connectivity are
presented. With the constraint sum i= 1 NS i= 0 strictly enforced, another solution can be …

Correlation in Landscapes of Combinatorial Optimization Problems Page 1 Correlation in
Landscapes of Combinatorial Optimization Problems To cite this article: PF Stadler 1992 EPL …

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 …