ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017


Article Details
Title: Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs
Article URLs:
Alternative Article URLs:
Authors: Colin Cooper
  • King’s College, Dept Informatics
Tomasz Radzik
  • King’s College, Dept Informatics
Nicolas Rivera
  • King’s College, Dept Informatics
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/spaa/CooperRR17
Author Comments:

Discuss this paper and its artifacts below