Derandomizing random walks in undirected graphs using locally fair exploration strategies
type: Item
instance of: scholarly article
title: Derandomizing random walks in undirected graphs using locally fair exploration strategies
zbMATH Open document ID: 1231.68178
author: Colin Cooper
author: David Ilcinkas
author: Ralf Klasing
author: Adrian Kosowski
published in: Distributed Computing
publication date: 2012-02-06T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C81
zbMATH DE Number: 6003521
zbMATH Keywords: graph exploration
zbMATH Keywords: random walk
zbMATH Keywords: rotor-router model
zbMATH Keywords: local knowledge
zbMATH Keywords: deterministic strategy
MaRDI profile type: Publication
cites work: Tree exploration with logarithmic memory
cites work: Euler Tour Lock-In Problem in the Rotor-Router Model
cites work: The power of a pebble: Exploring and mapping directed graphs
cites work: Traversing Directed Eulerian Mazes
cites work: Deterministic random walks on regular trees
cites work: Exploring an unknown graph
cites work: Cover times, blanket times, and majorizing measures
cites work: Deterministic Random Walks on the Two-Dimensional Grid
cites work: Graph exploration by a finite automaton
cites work: The cover time of deterministic random walks
cites work: Q4040986
cites work: The hitting and cover times of random walks on finite graphs using local degree information
cites work: Universal traversal sequences with backtracking.
cites work: Q4878667
cites work: Undirected ST-connectivity in log-space
cites work: Multiple cover time
cites work: A distributed ant algorithm for efficiently patrolling a network
full work available at URL: hal-00638229
OpenAlex ID: W4391922636
DOI: 10.1007/S00446-011-0138-4
description: scientific article; zbMATH DE number 6003521