Sign in

More efficient periodic traversal in anonymous undirected graphs.

Jurek CzyzowiczStefan DobrevLeszek GasieniecDavid IlcinkasJesper JanssonRalf KlasingIoannis LignosRussell MartinKunihiko SadakaneWing-Kin Sung
Published in: Theor. Comput. Sci. (2012)
Keyphrases
  • undirected graph
  • relational databases
  • computational complexity
  • closed form
  • directed graph
  • graph structure