Login / Signup

Packing algorithms for arborescences (and spanning trees) in capacitated graphs.

Harold N. GabowK. S. Manu
Published in: Math. Program. (1998)
Keyphrases
  • spanning tree
  • minimum spanning tree
  • learning algorithm
  • graph theory
  • minimum spanning trees
  • computational complexity
  • special case
  • np hard
  • depth first search
  • minimum total cost