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 …

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 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 …

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 …

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 …

We give a new and elementary computation of the spectral gap of the Kac walk on the N-
sphere. The result is obtained as a by-product of a more general observation which allows to …

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” …

Since Sewall Wright's seminal paper [1] the notion of a fitness landscape underlying the
dynamics of evolutionary adaptation optimization has proved to be one of the most powerful …

A comparison technique for random walks on finite graphs is introduced, using the well-
known interlacing method. It yields improved return probability bounds. A key feature is the …