95 search results - page 1 / 19 » Upper bounds on the non-3-colourability threshold of random ... |
DMTCS
2002
13 years 5 months ago
2002
SODA
2000
ACM
13 years 6 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
DM
2010
13 years 5 months ago
2010
In the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as ...
CAI
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In this paper we examine spectral properties of random intersection graphs when the number of vertices is equal to the number of labels. We call this class symmetric rand...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...