Home /Research /Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
OTHER

Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies

Colin Cooper, David Ilcinkas, Adrian Kosowski

Year
2009
Citations
6

Keywords

Undirected graphCombinatoricsTree traversalRandom walkEulerian pathMathematicsEnhanced Data Rates for GSM EvolutionGraphDiscrete mathematicsDirected graph

Related papers

Browse all OTHER papers