2310 search results - page 337 / 462 » Coloring Random Graphs |
APPROX
2011
Springer
12 years 8 months ago
2011
Springer
In a well-known result Goldreich and Trevisan (2003) showed that every testable graph property has a “canonical” tester in which a set of vertices is selected at random and the...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— We define “random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random wa...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
DAC
2009
ACM
14 years 9 months ago
2009
ACM
In this study, we apply a novel synthesis technique for implementing robust digital computation in nanoscale lattices with random interconnects: percolation theory on random graph...