Login / Signup

Lower and upper competitive bounds for online directed graph exploration.

Klaus-Tycho FoersterRoger Wattenhofer
Published in: Theor. Comput. Sci. (2016)
Keyphrases
  • directed graph
  • random walk
  • online learning
  • maximum flow
  • strongly connected
  • upper bound
  • lower bound
  • directed acyclic graph
  • graph structure
  • upper and lower bounds
  • worst case
  • graphical models
  • shortest path problem