2304 search results - page 132 / 461 » On the Vulnerability of Large Graphs |
140
click to vote
HT
2009
ACM
16 years 21 days ago
2009
ACM
This paper describes the Scalable Hyperlink Store, a distributed in-memory “database” for storing large portions of the web graph. SHS is an enabler for research on structural...
142
click to vote
IJCAI
2003
15 years 7 months ago
2003
Graphplan planning graphs are structures widely used in modern planners. The exclusion relations calculated in the planning graph extension provide very useful information, especi...
132
click to vote
FORTE
1998
15 years 7 months ago
1998
In a testing environment, where an IUT communicates with multiple entities, a tester may have di ering degrees of controllability on the interactions between these entities and th...
161
click to vote
COMBINATORICA
2007
15 years 6 months ago
2007
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion prop...
199
click to vote
IOR
2011
15 years 1 months ago
2011
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...