214 search results - page 13 / 43 » Note on Sparse Random Graphs and Cover Graphs |
CISS
2008
IEEE
14 years 2 months ago
2008
IEEE
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
ESA
2001
Springer
14 years 10 days ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
DAM
2008
13 years 8 months ago
2008
The paper studies crown reductions for the Minimum Weighted Vertex Cover problem introduced recently in the unweighted case by Fellows et al. [Blow-Ups, Win/Win's and crown r...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...