335 search results - page 2 / 67 » Resolvent of large random graphs |
SIGECOM
2006
ACM
15 years 5 months ago
2006
ACM
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
111
click to vote
ACSC
2005
IEEE
15 years 5 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
JCT
2007
14 years 11 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 → ∞,...
SODA
1998
ACM
15 years 1 months ago
1998
ACM
CPC
2002
14 years 11 months ago
2002
