2304 search results - page 29 / 461 » On the Vulnerability of Large Graphs |
WG
2010
Springer
13 years 8 months ago
2010
Springer
Motivated by questions in computer vision and sensor networks, Alpert et al. [3] introduced the following definitions. Given a graph G, an obstacle representation of G is a set of...
GD
2004
Springer
14 years 3 months ago
2004
Springer
Large graphs are difficult to browse and to visually explore. This note adds up evidence that some graph drawing techniques, which produce readable layouts when applied to medium-s...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
In this work we present a prototype for simulating computer network attacks. Our objective is to simulate large networks (thousands of hosts, with applications and vulnerabilities)...
AAAI
2008
13 years 12 months ago
2008
In this paper, a bottom-up hierarchical genetic algorithm is proposed to visualize clustered data into a planar graph. To achieve global optimization by accelerating local optimiz...
RSA
2002
13 years 9 months ago
2002
Let H be a fixed graph with h vertices, let G be a graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. It is known that in this ca...