2304 search results - page 81 / 461 » On the Vulnerability of Large Graphs |
WAW
2004
Springer
15 years 5 months ago
2004
Springer
In this paper we study the size of generalised dominating sets in two graph processes which are widely used to model aspects of the world-wide web. On the one hand, we show that gr...
JCT
2008
14 years 12 months ago
2008
A conjecture by Bollob
COMBINATORICS
2000
14 years 11 months ago
2000
We examine n
120
click to vote
ICICS
2009
Springer
15 years 6 months ago
2009
Springer
We propose a novel approach for statistical risk modeling of network attacks that lets an operator perform risk analysis using a data model and an impact model on top of an attack ...
JGT
2008
14 years 12 months ago
2008
We consider the following question: how large does n have to be to guarantee that in any two-colouring of the edges of the complete graph Kn,n there is a monochromatic Kk,k? In th...