2304 search results - page 258 / 461 » On the Vulnerability of Large Graphs |
132
click to vote
ISCAS
2006
IEEE
16 years 19 days ago
2006
IEEE
Synchronization in networks with different topolo- is shown that for typical systems only three main scenarios gies is studied. We show that for a large class of oscillators there ...
212
Voted
ADHOCNOW
2004
Springer
16 years 1 days 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 ...
204
click to vote
WADS
2001
Springer
15 years 11 months ago
2001
Springer
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...
165
click to vote
VLDB
1994
ACM
15 years 10 months ago
1994
ACM
A new type of optimization, called predicate move-around, ia introduced. It is shown how this optimization `considerably improvea the efficiency of evaluating SQL queries that hav...
174
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
In large wireless sensor networks, the problem of assigning radio frequencies to sensing agents such that no two connected sensors are assigned the same value (and will thus inter...