214 search results - page 12 / 43 » Note on Sparse Random Graphs and Cover Graphs |
WOWMOM
2009
ACM
14 years 2 months ago
2009
ACM
Random Walks (RWs) have been considered for information dissemination in large scale, dynamic and unstructured environments, as they are scalable, robust to topology changes and d...
ICITS
2011
12 years 11 months ago
2011
In this paper, we use the concept of colored edge graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirements...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
ICCTA
2007
IEEE
13 years 11 months ago
2007
IEEE
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
ICALP
2001
Springer
14 years 9 days ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...