Sciweavers

990 search results - page 75 / 198
» Sub-Graphs of Complete Graph
Sort
View
TAGT
1998
Springer
243views Graph Theory» more  TAGT 1998»
14 years 1 months ago
Double-Pullback Graph Transitions: A Rule-Based Framework with Incomplete Information
Reactive systems perform their tasks through interaction with their users or with other systems (as parts of a bigger system). An essential requirement for modeling such systems is...
Hartmut Ehrig, Reiko Heckel, Mercè Llabr&ea...
APSEC
2004
IEEE
14 years 24 days ago
Accurate Call Graph Extraction of Programs with Function Pointers Using Type Signatures
Software engineers need to understand programs in order to effectively maintain them. The call graph, which presents the calling relationships between functions, is a useful repre...
Darren C. Atkinson
JNSM
2008
93views more  JNSM 2008»
13 years 9 months ago
Optimal IDS Sensor Placement and Alert Prioritization Using Attack Graphs
We optimally place intrusion detection system (IDS) sensors and prioritize IDS alerts using attack graph analysis. We begin by predicting all possible ways of penetrating a networ...
Steven Noel, Sushil Jajodia
ENDM
2007
91views more  ENDM 2007»
13 years 9 months ago
On facets of stable set polytopes of claw-free graphs with stability number three
Providing a complete description of the stable set polytopes of claw-free graphs is a longstanding open problem since almost twenty years. Eisenbrandt et al. recently achieved a b...
Arnaud Pêcher, Pierre Pesneau, Annegret Wagl...
TALG
2008
97views more  TALG 2008»
13 years 9 months ago
On an infinite family of solvable Hanoi graphs
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
Dany Azriel, Noam Solomon, Shay Solomon