Optimal cover time for a graph-based coupon collector process (Q2434930)

From MaRDI portal
Revision as of 12:57, 4 August 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
Optimal cover time for a graph-based coupon collector process
scientific article

    Statements

    Optimal cover time for a graph-based coupon collector process (English)
    0 references
    0 references
    0 references
    3 February 2014
    0 references
    coupon collector process
    0 references
    graph covering
    0 references
    delay sequence argument
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references