2304 search results - page 69 / 461 » On the Vulnerability of Large Graphs |
101
click to vote
CORR
2010
Springer
14 years 6 months ago
2010
Springer
We introduce a new simulation platform called Insight, created to design and simulate cyber-attacks against large arbitrary target scenarios. Insight has surprisingly low hardware...
CCS
2009
ACM
15 years 6 months ago
2009
ACM
Open source software is often considered to be secure. One factor in this confidence in the security of open source software lies in leveraging large developer communities to find...
104
click to vote
ISSA
2004
15 years 1 months ago
2004
This paper attempts to address the issue of hardening the internal security of an organisation's network by easing its patch management. Traditionally security has been model...
STOC
2002
ACM
16 years 4 days ago
2002
ACM
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
JGAA
2010
14 years 10 months ago
2010
We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. For positive we have a construction which shows that all chordal graphs that ca...