Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies (Q3638110)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5578423
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies |
scientific article; zbMATH DE number 5578423 |
Statements
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies (English)
0 references
14 July 2009
0 references
exploring an anonymous graph
0 references
oblivious robot
0 references
derandomize random walks
0 references
oldest first
0 references
least used first
0 references
0.9880298972129822
0 references
0.8132632970809937
0 references
0.7040278911590576
0 references
