672 search results - page 33 / 135 » Lower-stretch spanning trees |
139
Voted
WDAG
2007
Springer
15 years 9 months ago
2007
Springer
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
121
Voted
RSA
2011
14 years 10 months ago
2011
We prove that for fixed integer D and positive reals α and γ, there exists a constant C0 such that for all p satisfying p(n) ≥ C0/n, the random graph G(n, p) asymptotically a...
120
Voted
SIAMDM
2010
14 years 10 months ago
2010
We prove that if T is a tree on n vertices with maximum degree and the edge probability p(n) satisfies: np C max{ log n, n } for some constant > 0, then with high probability...
93
Voted
ESA
2009
Springer
15 years 10 months ago
2009
Springer