2304 search results - page 141 / 461 » On the Vulnerability of Large Graphs |
142
click to vote
RSA
2006
15 years 6 months ago
2006
: We study a model of random graphs, where a random instance is obtained by adding random edges to a large graph of a given density. The research on this model has been started by ...
137
click to vote
WG
2010
Springer
15 years 4 months ago
2010
Springer
We prove that for sufficiently large n, there exist unit disk graphs on n vertices such that for every representation with disks in the plane at least c √ n bits are needed to wr...
178
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
198
click to vote
AC
2000
Springer
15 years 10 months ago
2000
Springer
The management of large databases of hierarchical (e.g., multi-scale or multilevel) image features is a common problem in object recognition. Such structures are often represented ...
CPC
2008
15 years 6 months ago
2008
If G is a graph with vertex set [n] then A 2[n] is G-intersecting if for all A, B A either A B = or there exist a A and b B such that a G b. The question of how large a k-un...