Random walks which prefer unvisited edges.

DOI10.1145/2332432.2332438zbMath1301.68197OpenAlexW2163459627MaRDI QIDQ2933774

Colin Cooper, Tom Friedetzky, Petra Berenbrink

Publication date: 5 December 2014

Published in: Proceedings of the 2012 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2332432.2332438

zbMATH Keywords

random walknetwork search

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Distributed algorithms (68W15) Random walks on graphs (05C81)

Related Items (1)

Deterministic walks with choice

This page was built for publication: Random walks which prefer unvisited edges.