2304 search results - page 147 / 461 » On the Vulnerability of Large Graphs |
214
click to vote
ICDM
2006
IEEE
16 years 9 days ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
151
click to vote
GC
2004
Springer
15 years 11 months ago
2004
Springer
This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast. Our algorithm scales in terms of both network and memory usage. Processes only h...
173
click to vote
SIGDOC
2000
ACM
15 years 10 months ago
2000
ACM
We address two problems of technical authors in structured environments: (1) Structure definitions of the SGML school are limiting: they require one primary hierarchy and do not c...
155
click to vote
JGT
2007
15 years 6 months ago
2007
A well-known theorem of Mader [5] states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. Solving a problem of Diestel [2], we ex...
324
click to vote
CL
2012
Springer
13 years 8 months ago
2012
Springer
In object-oriented systems, runtime memory is composed of an object graph in which objects refer to other objects. This graph of objects evolves while the system is running. Graph...