New Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs (2019)

First Author: Cooper C

Attributed to: Randomized Algorithms for Computer Networks funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1145/3364206

Publication URI: http://dx.doi.org/10.1145/3364206

Type: Journal Article/Review

Parent Publication: ACM Transactions on Parallel Computing

Issue: 3