267 search results - page 20 / 54 » Anti-Ramsey properties of random graphs |
RSA
2008
13 years 8 months ago
2008
: In this article, we initiate a systematic study of graph resilience. The (local) resilience of a graph G with respect to a property P measures how much one has to change G (local...
ADHOCNOW
2004
Springer
14 years 2 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
COMSWARE
2007
IEEE
14 years 3 months ago
2007
IEEE
— Recent studies on wireless sensor networks (WSN) have shown that the duration of contacts and inter-contacts are power law distributed. While this is a strong property of these...
ICML
2008
IEEE
14 years 9 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
GLOBECOM
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract—In this paper, we consider the problem of multifunctional compression with side information. The problem is how we can compress a source X so that the receiver is able t...