Login / Signup

Independent arborescences in directed graphs.

András FrankSatoru FujishigeNaoyuki KamiyamaNaoki Katoh
Published in: Discret. Math. (2013)
Keyphrases
  • directed graph
  • random walk
  • graph structure
  • directed acyclic graph
  • undirected graph
  • strongly connected
  • graph structures
  • maximum flow
  • optimal solution