2304 search results - page 173 / 461 » On the Vulnerability of Large Graphs |
167
click to vote
STOC
1994
ACM
15 years 10 months ago
1994
ACM
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
168
click to vote
CPC
2007
15 years 6 months ago
2007
We study a dynamically evolving random graph which adds vertices and edges using preferential attachment and is “attacked by an adversary”. At time t, we add a new vertex xt a...
180
click to vote
JCT
2006
15 years 6 months ago
2006
We give two short proofs that for fixed d, a d-regular Cayley graph on an Abelian group of order n has second eigenvalue bounded below by d - O(dn-4/d), where the implied constant...
201
click to vote
DASFAA
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract. Discovery of evolving regions in large graphs is an important issue because it is the basis of many applications such as spam websites detection in the Web, community lif...
175
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Nested codes have been employed in a large number of communication applications as a specific case of superposition codes, for example to implement binning schemes in the presence ...