2304 search results - page 13 / 461 » On the Vulnerability of Large Graphs |
GC
2002
Springer
13 years 9 months ago
2002
Springer
The main result of the papzer is that any planar graph with odd girth at least 10k
JCT
2007
13 years 9 months ago
2007
Let G be a d-regular graph with girth g, and let α be the independence number of G. We show that α(G) ≥ 1 2 1 − (d − 1)−2/(d−2) − (g) n where (g) → 0 as g → ∞,...
COMAD
2009
13 years 10 months ago
2009
Identifying communities in social networks is a problem of great interest. One popular type of community is where every member of the community knows all others, which can be view...
JGT
2010
13 years 8 months ago
2010
While finite cop-win finite graphs possess a good structural characterization, none is known for infinite cop-win graphs. As evidence that such a characterization might not exis...
ISLPED
2009
ACM
14 years 4 months ago
2009
ACM
Power gating is usually driven by a predictive control, and frequent mispredictions can counter-productively lead to a large increase in energy consumption. This energy vulnerabil...