The cover time of a biased random walk on G n,p
Attributed to:
Randomized Algorithms for Computer Networks
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1137/1.9781611975062.14
Publication URI: http://dx.doi.org/10.1137/1.9781611975062.14
Type: Book Chapter
Book Title: 2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (2018)
Page Reference: 158-167