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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Tree exploration with logarithmic memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euler Tour Lock-In Problem in the Rotor-Router Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of a pebble: Exploring and mapping directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traversing Directed Eulerian Mazes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic random walks on regular trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring an unknown graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cover times, blanket times, and majorizing measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Random Walks on the Two-Dimensional Grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph exploration by a finite automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cover time of deterministic random walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hitting and cover times of random walks on finite graphs using local degree information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal traversal sequences with backtracking. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected ST-connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple cover time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distributed ant algorithm for efficiently patrolling a network / rank
 
Normal rank

Revision as of 20:57, 4 July 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
    graph exploration
    0 references
    random walk
    0 references
    rotor-router model
    0 references
    local knowledge
    0 references
    deterministic strategy
    0 references

    Identifiers