Home /Research /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

Year
2010
Citations
7

Keywords

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

Related papers

Browse all OTHER papers