617 search results - page 78 / 124 » On the Chromatic Number of Random Graphs |
135
click to vote
JCO
2010
15 years 2 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
149
click to vote
COCOA
2009
Springer
15 years 11 months ago
2009
Springer
This work presents a simple graph based heuristic that employs a roulette wheel selection mechanism for solving examination timetabling problems. We arrange exams in non-increasing...
168
click to vote
SAC
2010
ACM
15 years 11 months ago
2010
ACM
We consider self-stabilizing and self-organizing distributed construction of a spanner that forms an expander. The following results are presented. • A randomized technique to r...
137
click to vote
SODA
2007
ACM
15 years 5 months ago
2007
ACM
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
127
click to vote
CVIU
2007
15 years 4 months ago
2007
This article proposes a generative image model, which is called ‘‘primal sketch,’’ following Marr’s insight and terminology. This model combines two prominent classes of...