2304 search results - page 129 / 461 » On the Vulnerability of Large Graphs |
147
Voted
WAW
2009
Springer
16 years 22 days ago
2009
Springer
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
173
Voted
INFOVIS
2002
IEEE
15 years 11 months ago
2002
IEEE
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...
165
click to vote
INFOCOM
1997
IEEE
15 years 10 months ago
1997
IEEE
Due to the increasing reliance of our society on the timely and reliable transfer of large quantities of information (suchas voice, data, and video)across high speed communication...
164
Voted
CMSB
2006
Springer
15 years 10 months ago
2006
Springer
Having in mind the large-scale analysis of gene regulatory networks, we review a graph decimation algorithm, called "leaf-removal", which can be used to evaluate the feed...
164
click to vote
DAGSTUHL
2001
15 years 7 months ago
2001
To understand the dynamics of a running program, it is often useful to examine its state at specific moments during its execution. We present memory graphs as a means to capture an...