Sciweavers

1986 search results - page 185 / 398
» Path Separability of Graphs
Sort
View
ACSAC
2006
IEEE
14 years 4 months ago
Practical Attack Graph Generation for Network Defense
Attack graphs are a valuable tool to network defenders, illustrating paths an attacker can use to gain access to a targeted network. Defenders can then focus their efforts on patc...
Kyle Ingols, Richard Lippmann, Keith Piwowarski
ICTAC
2005
Springer
14 years 3 months ago
Stochastic Analysis of Graph Transformation Systems: A Case Study in P2P Networks
In distributed and mobile systems with volatile bandwidth and fragile connectivity, non-functional aspects like performance and reliability become more and more important. To forma...
Reiko Heckel
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
14 years 2 months ago
On the Parameterized Complexity of Layered Graph Drawing
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admittin...
Vida Dujmovic, Michael R. Fellows, Michael T. Hall...
VISSYM
2007
14 years 18 days ago
Grouse: Feature-Based, Steerable Graph Hierarchy Exploration
Grouse is a feature-based approach to steerable exploration of a graph and an associated hierarchy. Steerability allows exploration to begin immediately, rather than requiring a c...
Daniel Archambault, Tamara Munzner, David Auber
SIAMDM
2008
79views more  SIAMDM 2008»
13 years 10 months ago
Reconfigurations in Graphs and Grids
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
Gruia Calinescu, Adrian Dumitrescu, János P...