Login / Signup

First cycles in random directed graph processes.

Béla BollobásSteen Rasmussen
Published in: Discret. Math. (1989)
Keyphrases
  • directed graph
  • random walk
  • graph structure
  • maximum flow
  • disjoint paths
  • directed edges
  • reinforcement learning
  • shortest path problem
  • strongly connected
  • computational models
  • undirected graph
  • graph properties