2304 search results - page 92 / 461 » On the Vulnerability of Large Graphs |
116
click to vote
CGF
2010
15 years 1 months ago
2010
Graph visualization systems often exploit opaque metanodes to reduce visual clutter and improve the readability of large graphs. This filtering can be done in a path-preserving wa...
131
click to vote
APPROX
2008
Springer
15 years 3 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
121
click to vote
BICOB
2009
Springer
15 years 8 months ago
2009
Springer
The de novo assembly of genomes from high-throughput short reads is an active area of research. Several promising methods have been recently developed, with applicability mainly re...
151
click to vote
WAW
2004
Springer
15 years 7 months ago
2004
Springer
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
167
click to vote
WOSP
1998
ACM
15 years 5 months ago
1998
ACM
The POEMS project is creating an environment for end-to-end performance modeling of complex parallel and distributed systems, spanning the domains of application software, runti...