Sciweavers

534 search results - page 50 / 107
» Diameter critical graphs
Sort
View
INFOCOM
2003
IEEE
15 years 4 months ago
Static and Dynamic Analysis of the Internet's Susceptibility to Faults and Attacks
— We analyze the susceptibility of the Internet to random faults, malicious attacks, and mixtures of faults and attacks. We analyze actual Internet data, as well as simulated dat...
Seung-Taek Park, Alexy Khrabrov, David M. Pennock,...
CPC
2006
110views more  CPC 2006»
14 years 11 months ago
Bootstrap Percolation on Infinite Trees and Non-Amenable Groups
Abstract. Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deter...
József Balogh, Yuval Peres, Gábor Pe...
GG
2004
Springer
15 years 4 months ago
Fundamental Theory for Typed Attributed Graph Transformation
The concept of typed attributed graph transformation is most significant for modeling and meta modeling in software engineering and visual languages, but up to now there is no ade...
Hartmut Ehrig, Ulrike Prange, Gabriele Taentzer
CCS
2006
ACM
15 years 2 months ago
Attack graph generation and analysis
In this paper, we position the correct way of using graphical models for enhancing cyber security analysis in enterprise networks. Graphical models can be powerful in representati...
Jeannette M. Wing
ESOP
2006
Springer
15 years 2 months ago
Path Optimization in Programs and Its Application to Debugging
We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we find a shortest path through the program's control flow g...
Akash Lal, Junghee Lim, Marina Polishchuk, Ben Lib...