Talk:Edmonds' algorithm
Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This article is rated Start-class on Wikipedia's content assessment scale.
It is of interest to the following WikiProjects:
It is of interest to the following WikiProjects:
WikiProject icon This article is within the scope of WikiProject Mathematics , a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
Low This article has been rated as Low-priority on the project's priority scale.
| WikiProject icon | Computer science Mid‐importance | ||||||||||
| |||||||||||
On the external link page it seems one has to define which node is the root (though this wouldn't guarantee the tree is the globally optimal), but here it doesn't. I think some clarification on this point is needed. 88.74.10.111 (talk) 15:54, 29 June 2008 (UTC) [reply ]
This page is pretty much useless. I came here expecting a nice explanation of this algorithm. Alas, it was not to be found! ~ —Preceding unsigned comment added by 173.60.204.46 (talk) 02:37, 11 October 2010 (UTC) [reply ]
optimum branchings
[edit ]The term "optimum branchings" should be definitely explained in more details, Mir76 (talk) 01:58, 31 July 2014 (UTC) [reply ]