2304 search results - page 25 / 461 » On the Vulnerability of Large Graphs |
GD
1998
Springer
14 years 1 months ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
JPDC
2007
13 years 9 months ago
2007
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
CSE
2009
IEEE
14 years 4 months ago
2009
IEEE
Abstract—We present here a method for analyzing the neighborhoods of all the vertices in a large graph. We first give an algorithm for characterizing a simple undirected graph t...
ICCAD
1999
IEEE
14 years 1 months ago
1999
IEEE
State space techniques have proven to be useful for measuring and improving the coverage of test vectors that are used during functional validation via simulation. By comparing th...
RAID
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Network worms are malicious programs that spread automatically across networks by exploiting vulnerabilities that affect a large number of hosts. Because of the speed at...