Highly Influential

For an undirected graph and an optimal cyclic list of all its vertices, the cyclic cover time is the expected time it takes a simple random walk to travel from vertex to vertex along the list, until it completes a full cycle. The main result of this paper is a characterization of the cyclic cover time in terms of simple and easy to compute graph properties… (More)

### Presentations referencing similar topics