Show simple item record

dc.contributor.authorDimitrov, Nedialko B.
dc.contributor.authorPlaxton, C. Greg
dc.date.accessioned2013-12-05T20:56:09Z
dc.date.available2013-12-05T20:56:09Z
dc.date.issued2013
dc.identifier.citationNedialko B. Dimitrov and C. Greg Plaxton. Optimal Cover Time for a Graph-Based Coupon Collector Process. Journal of Discrete Algorithms, February, 2013, doi:10.1016/j.jda.2013.02.003
dc.identifier.urihttp://hdl.handle.net/10945/37915
dc.descriptionJournal of Discrete Algorithms, February, 2013en_US
dc.descriptionThe article of record as published may be located at http://dx.doi.org/10.1016/j.jda.2013.02.003en_US
dc.description.abstractIn this paper we study the following covering process defined over an arbitrary directed graph. Each node is initially uncovered and is assigned a random integer rank drawn from a suitable range. The process then proceeds in rounds. In each round, a uniformly random node is selected and its lowest-ranked uncovered outgoing neighbor, if such exists, is covered...en_US
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.en_US
dc.titleOptimal Cover Time for a Graph-Based Coupon Collector Processen_US
dc.typeArticleen_US
dc.subject.authorCoupon Collector Processen_US
dc.subject.authorGraph Coveringen_US
dc.subject.authorSequence Argumenten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record