Content deleted Content added
query on blossom diagram |
No edit summary |
||
Line 23:
yes, you are right! actually, tarjan's notes (that is where the theorem was taken from) also have some additional conditions on what blossoms qualify for the shrinking theorem. i think there are two ways how this could be fixed. do literature search and see how blossoms are defined in other sources. if they are still defined as in the wiki article, then the theorem in the main article has to be updated to state the additional conditions under which the theorem holds. if cycles have to have "stems" in order to be called blossoms, then only the definition of blossoms has to be changed to reflect this. that said, i believe the algorithm is still correct and so only either the theorem or the definition of blossoms have to be changed.
[[Special:Contributions/128.148.33.99|128.148.33.99]] ([[User talk:128.148.33.99|talk]]) 21:44, 14 July 2010 (UTC)
: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)
===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)
| |||