On the cover time of random walks on graphs (Q1823548)

From MaRDI portal
Revision as of 01:57, 28 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the cover time of random walks on graphs
scientific article

    Statements

    On the cover time of random walks on graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    random walks on arbitrary graphs
    0 references
    expected time needed for a randm walk on a finite graph to visit
    0 references
    every vertex
    0 references
    expected time needed for a randm walk on a finite graph to visit every vertex
    0 references

    Identifiers