Maximum branching

From Algowiki
Revision as of 14:28, 9 October 2014 by Weihe (talk | contribs) (Created page with "== General information == '''Definition:''' A '''branching''' is a cycle-free '''Input:''' # A directed graph <math>G=(V,A)</math>: # A real-valued weight <math>w(a)</math>...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

General information

Definition: A branching is a cycle-free


Input:

  1. A directed graph [math]\displaystyle{ G=(V,A) }[/math]:
  2. A real-valued weight [math]\displaystyle{ w(a) }[/math] for each arc [math]\displaystyle{ a\in A }[/math].


Output: A

Retrieved from "https://wiki.algo.informatik.tu-darmstadt.de/index.php?title=Maximum_branching&oldid=784"