Login / Signup

Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs.

Jørgen Bang-JensenDaniel GonçalvesInge Li Gørtz
Published in: Discret. Optim. (2007)
Keyphrases
  • weighted graph
  • edge disjoint
  • spanning tree
  • shortest path
  • undirected graph
  • edge weights
  • pairwise
  • decision trees
  • graph structure
  • data objects
  • total length
  • regularization framework
  • image processing
  • bayesian networks