Login / Signup

Covering the edge set of a directed graph with trees.

K. Vidyasankar
Published in: Discret. Math. (1978)
Keyphrases
  • directed graph
  • undirected graph
  • decision trees
  • small number
  • random walk
  • strongly connected
  • disjoint paths
  • leaf nodes
  • multiscale
  • optimal solution
  • probability distribution
  • approximation algorithms
  • graph structure