30 search results - page 1 / 6 » Max Cut for Random Graphs with a Planted Partition |
CPC
2004
15 years 7 days ago
2004
103
click to vote
EVOW
2004
Springer
15 years 5 months ago
2004
Springer
This paper introduces a new social metaheuristic for the Max-Cut problem applied to a weighted undirected graph. This problem consists in finding a partition of the nodes into two ...
CPC
2006
15 years 13 days ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
69
Voted
CORR
2010
Springer
15 years 15 days ago
2010
Springer
: We give the first combinatorial approximation algorithm for MAXCUT that beats the trivial 0.5 factor by a constant. The main partitioning procedure is very intuitive, natural, an...
82
Voted
FCT
2005
Springer
15 years 6 months ago
2005
Springer
A partitioning of a set of n items is a grouping of these items into k disjoint, equally sized classes. Any partition can be modeled as a graph. The items become the vertices of th...