18 search results - page 3 / 4 » Conditionally Critical Indecomposable Graphs |
64
Voted
ECEASST
2008
14 years 9 months ago
2008
Abstract: In several rule-based applications using graph transformation as underlying modeling technique the following questions arise: How can one be sure that a specific sequence...
COMCOM
2006
14 years 9 months ago
2006
In defending one's network against cyber attack, certain vulnerabilities may seem acceptable risks when considered in isolation. But an intruder can often infiltrate a seemin...
61
Voted
ICDM
2008
IEEE
15 years 4 months ago
2008
IEEE
In graph mining, a frequency measure is anti-monotonic if the frequency of a pattern never exceeds the frequency of a subpattern. The efficiency and correctness of most graph pat...
WAW
2009
Springer
15 years 4 months ago
2009
Springer
We consider a random subgraph Gp of a host graph G formed by retaining each edge of G with probability p. We address the question of determining the critical value p (as a function...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...