Sign in
More efficient periodic traversal in anonymous undirected graphs.
Jurek Czyzowicz
Stefan Dobrev
Leszek Gasieniec
David Ilcinkas
Jesper Jansson
Ralf Klasing
Ioannis Lignos
Russell Martin
Kunihiko Sadakane
Wing-Kin Sung
Published in:
Theor. Comput. Sci. (2012)
Keyphrases
</>
undirected graph
relational databases
computational complexity
closed form
directed graph
graph structure