140
click to vote
FOCS
2003
IEEE
15 years 10 months ago
2003
IEEE
We show that random graphs in the preferential connectivity model have constant conductance, and hence have worst-case routing congestion that scales logarithmically with the numb...