617 search results - page 113 / 124 » On the Chromatic Number of Random Graphs |
SAT
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
FOCS
1998
IEEE
13 years 12 months ago
1998
IEEE
In the Finite Capacity Dial-a-Ride problem the input is a metric space, a set of objects {di}, each specifying a source si and a destination ti, and an integer k--the capacity of t...
CONEXT
2007
ACM
13 years 11 months ago
2007
ACM
Portable devices have more data storage and increasing communication capabilities everyday. In addition to classic infrastructure based communication, these devices can exploit hu...
DIALM
2008
ACM
13 years 9 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
OPODIS
2008
13 years 9 months ago
2008
Abstract. We consider the problem of Rendezvous or gathering of multiple autonomous entities (called mobile agents) moving in an unlabelled environment (modelled as a graph). The p...