A Tractable Variant of Cover Time
Combinatorics
2012-06-29 v1 Discrete Mathematics
Abstract
We introduce a variant of the cover time of a graph, called cover cost, in which the cost of a step is proportional to the number of yet uncovered vertices. It turns out that cover cost is more tractable than cover time; we provide an algorithm for its computation, as well as some explicit formulae. The two values are not very far from each other, and so cover cost might be a useful tool in the study of cover time.
Cite
@article{arxiv.1206.6605,
title = {A Tractable Variant of Cover Time},
author = {Agelos Georgakopoulos},
journal= {arXiv preprint arXiv:1206.6605},
year = {2012}
}