Derandomizing random walks in undirected graphs using locally fair exploration strategies (Q661051)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Derandomizing random walks in undirected graphs using locally fair exploration strategies |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Derandomizing random walks in undirected graphs using locally fair exploration strategies |
scientific article |
Statements
Derandomizing random walks in undirected graphs using locally fair exploration strategies (English)
0 references
6 February 2012
0 references
graph exploration
0 references
random walk
0 references
rotor-router model
0 references
local knowledge
0 references
deterministic strategy
0 references
0 references
