Login / Signup

Iterating the branching operation on a directed graph.

Christos A. Athanasiadis
Published in: J. Graph Theory (1997)
Keyphrases
  • directed graph
  • random walk
  • branch and bound
  • directed acyclic graph
  • graph structure
  • shortest path problem
  • search tree
  • source node
  • directed edges
  • data streams
  • lower bound
  • connected components
  • web graph
  • maximum flow