Maximum spanning forest: Difference between revisions
Jump to navigation
Jump to search
Dkratschmann (talk | contribs) No edit summary |
(→Output) |
||
| Line 4: | Line 4: | ||
== Output == | == Output == | ||
An [[undirected forest]] <math> F= (V,E_F)</math> such that <math>E_F \subseteq E</math>. | An [[Basic graph definitions#Forests, trees, branchings, arborescences|undirected forest]] <math> F= (V,E_F)</math> such that <math>E_F \subseteq E</math>. | ||
== Objective == | == Objective == | ||
Revision as of 12:30, 16 June 2015
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.