论文信息 - The Cover Time of a Regular Expander is O(n log n) - 字舞流文

The Cover Time of a Regular Expander is O(n log n)

Ronitt Rubinfeld | R. Rubinfeld

[1] Eli Upfal,et al. Constructing disjoint paths on expander graphs , 1987, Comb..

[2] Joel Friedman,et al. Expanding graphs contain all small trees , 1987, Comb..