The cover time of a regular expander is O(n log n)

Ronitt Rubinfeld*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Original languageEnglish
Pages (from-to)49-51
Number of pages3
JournalInformation Processing Letters
Volume35
Issue number1
DOIs
StatePublished - 15 Jun 1990
Externally publishedYes

Funding

FundersFunder number
National Science FoundationCCR 88-13632
International Business Machines Corporation

    Keywords

    • Analysis of algorithms
    • combinatorial problems
    • computational complexity
    • theory of computation

    Cite this