7 search results - page 1 / 2 » Coloring Sparse Random k-Colorable Graphs in Polynomial Expe... |
130
Voted
MFCS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
134
Voted
MST
2010
15 years 19 days ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
124
Voted
APPROX
2009
Springer
15 years 8 months ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
106
Voted
CP
2004
Springer
15 years 7 months ago
2004
Springer
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...