Content deleted Content added
→Can someone check, please?: new section |
order in sections and reply |
||
Line 1:
{{maths rating|class=Start|priority=Low|field=discrete}}
== Blossom definition problem ==
i think the definition of blossom here is slightly incorrect. a blossom is not just a cycle of size 2k+1 that
contains exactly k matched edges. if it were that, then, contrary to the main theorem about blossoms,
Line 25 ⟶ 28:
:One source that points this out and gives a correct version of the algorithm is Jungnickel ''Graphs, Networks and Algorithms''. --[[Special:Contributions/46.253.62.108|46.253.62.108]] ([[User talk:46.253.62.108|talk]]) 05:06, 7 September 2011 (UTC)
::I made a correct description of the algorithm in de.WP and also provided a correct example. [[:de:Paarung_(Graphentheorie)#Algorithmus_von_Edmonds]]. Not sure when or if I will find time & leisure to translate it. --[[user:0g1o2i3k4e5n6|goiken]] 17:24, 12 September 2011 (UTC)
:::I tried to account for the problem you reported and to reformulate the article. Hopefully it is correct now. --[[User:A3 nm|a3_nm]] ([[User talk:A3 nm|talk]]) 15:26, 2 June 2012 (UTC)
===Blossom Diagram & Augmenting path===▼
In the first blossom diagram, the augmenting path that is shown starts at u. Since u is adjacent to an edge in the matching, that isn't an augmenting path, right? [[User:Zabwung|Zabwung]] ([[User talk:Zabwung|talk]]) 00:58, 6 July 2011 (UTC)
:I updated the diagrams. Does this problem still occur? --[[User:A3 nm|a3_nm]] ([[User talk:A3 nm|talk]]) 15:26, 2 June 2012 (UTC)
== Can someone check, please? ==
| |||