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

The minimum bisection problem is to partition the vertices of a graph into two classes of
equal size so as to minimize the number of crossing edges. Computing a minimum bisection …

The Ising antiferromagnet is an important statistical physics model with close connections to
the Max Cut problem. Combining spatial mixing arguments with the method of moments 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 …

We study the graph coloring problem over random graphs of finite average connectivity c.
Given a number q of available colors, we find that graphs with low connectivity admit almost …

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 …

Graph theory provides fundamental concepts for many fields of science like statistical
physics, network analysis and theoretical computer science. Here we give a pedagogical …

We analytically describe the typical solution time needed by a backtracking algorithm to
solve the vertex-cover problem on finite-connectivity random graphs. We find two different …

In this paper we study the component structure of random graphs with independence
between the edges. Under mild assumptions, we determine whether there is a giant …

We resolve in the affirmative a question of Boppana and Bui: whether simulated annealing
can, with high probability and in polynomial time, find the optimal bisection of a random …