Derandomizing random walks in undirected graphs using locally fair exploration strategies (Q661051): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 09:52, 30 January 2024

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
    0 references
    0 references
    0 references
    0 references
    6 February 2012
    0 references
    0 references
    graph exploration
    0 references
    random walk
    0 references
    rotor-router model
    0 references
    local knowledge
    0 references
    deterministic strategy
    0 references