Jump to content

Talk:Edmonds' algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Cewbot (talk | contribs) at 12:34, 17 January 2024 (Maintain {{WPBS}} and vital articles: 2 WikiProject templates. Create {{WPBS}}. Keep majority rating "Start" in {{WPBS}}. Remove 2 same ratings as {{WPBS}} in {{Maths rating}}, {{WikiProject Computer science}}. Remove 1 deprecated parameter: field.). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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]