📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

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