Pages that link to "Item:Q661051"
From MaRDI portal
The following pages link to Derandomizing random walks in undirected graphs using locally fair exploration strategies (Q661051):
Displaying 8 items.
- Bounds on the cover time of parallel rotor walks (Q269498) (← links)
- Deterministic walks with choice (Q741725) (← links)
- The robot crawler graph process (Q1671307) (← links)
- Symmetry in domination for hypergraphs with choice (Q2333489) (← links)
- The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks (Q2407630) (← links)
- Robustness of the rotor-router mechanism (Q2408092) (← links)
- Lower Bounds for Graph Exploration Using Local Policies (Q2803810) (← links)
- Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time (Q5175230) (← links)
