首页 /研究 /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

发表年份
2009
引用次数
6

关键词

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

相关论文

查看 OTHER 分类全部论文