Maximum spanning forest: Difference between revisions
Jump to navigation
Jump to search
Dkratschmann (talk | contribs) (Created page with "== Input == # An undirected graph <math>G = (V,E)</math>, not necessarily connected. # An edge length <math>l(e) \in \mathbb{R}_0^+</math> for each edge <math>e \in E</mat...") |
Dkratschmann (talk | contribs) No edit summary |
||
| Line 12: | Line 12: | ||
== Complexity == | == Complexity == | ||
Polynomial | Polynomial. | ||
== Known algorithms == | == Known algorithms == | ||
Revision as of 20:01, 6 October 2014
Input
- An undirected graph [math]\displaystyle{ G = (V,E) }[/math], not necessarily connected.
- An edge length [math]\displaystyle{ l(e) \in \mathbb{R}_0^+ }[/math] for each edge [math]\displaystyle{ e \in E }[/math].
Output
An undirected forest [math]\displaystyle{ F= (V,E_F) }[/math] such that [math]\displaystyle{ E_F \subseteq E }[/math].
Objective
Maximize: [math]\displaystyle{ \sum{}{}_{e \in E_F}l(e) }[/math].
Complexity
Polynomial.