首页 /研究 /More Efficient Periodic Traversal in Anonymous Undirected Graphs
OTHER

More Efficient Periodic Traversal in Anonymous Undirected Graphs

Jurek Czyzowicz, Stefan Dobrev, Leszek Gąsieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell Martin, Kunihiko Sadakane, Wing‐Kin Sung

发表年份
2010
引用次数
7

关键词

Period lengthUndirected graphCombinatoricsTree traversalComputer scienceUpper and lower boundsConstant (computer programming)GraphDiscrete mathematicsSet (abstract data type)

相关论文

查看 OTHER 分类全部论文