142 search results - page 13 / 29 » The Diameter of Sparse Random Graphs |
INFOCOM
2003
IEEE
14 years 3 months ago
2003
IEEE
— Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led s...
ICALP
2010
Springer
13 years 11 months ago
2010
Springer
Given a connected graph G and a failure probability pe for each edge e in G, the reliability of G is the probability that G remains connected when each edge e is removed independe...
ICCTA
2007
IEEE
14 years 1 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...
APPROX
2004
Springer
14 years 3 months ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
MST
2010
13 years 8 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...