2304 search results - page 248 / 461 » On the Vulnerability of Large Graphs |
136
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this work we study the asymptotic traffic behaviour for Gromov's hyperbolic networks as the size of the network increases. We prove that under certain mild hypothesis the t...
148
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
We present a variation of James Propp's generalized domino shuffling, which provides an efficient way to obtain perfect matchings of weighted Aztec diamonds. Our modification...
148
click to vote
SIAMDM
2008
15 years 6 months ago
2008
We consider the problem of assigning a numerical channel to each transmitter in a large regular array such that multiple levels of interference, which depend on the distance betwe...
194
click to vote
PLDI
2009
ACM
16 years 1 months ago
2009
ACM
Symbolic analysis shows promise as a foundation for bug-finding, specification inference, verification, and test generation. This paper addresses demand-driven symbolic analysi...
181
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...