Content deleted Content added
order in sections and reply |
m Maintain {{WPBS}}: 1 WikiProject template. Remove 1 deprecated parameter: field. Tag: |
||
| (15 intermediate revisions by 12 users not shown) | |||
Line 1:
{{
{{WikiProject Mathematics|priority=Low}}
}}
== Description of the Blossom finding algorithm ==
The current description of the blossom finding algorithm doesn't refer to the matching after the step where it finds an exposed vertex. Isn't there something missing? --[[User:Lorenzo.Najt|Lorenzo.Najt]] ([[User talk:Lorenzo.Najt|talk]]) 22:12, 15 October 2019 (UTC)
== Blossom definition problem ==
Line 42 ⟶ 48:
Maybe that quote is referring to something different. But that sentence is the only match I found for "if and only if". [[User:Girlwithgreeneyes|Girlwithgreeneyes]] ([[User talk:Girlwithgreeneyes|talk]]) 23:04, 9 April 2012 (UTC)
:"[[If and only if|iff]]" is a common abbreviation in mathematics and not a typo. I think this problem is fixed now. --[[User:A3 nm|a3_nm]] ([[User talk:A3 nm|talk]]) 15:28, 2 June 2012 (UTC)
::Okay, thanks for that. [[User:Girlwithgreeneyes|Girlwithgreeneyes]] ([[User talk:Girlwithgreeneyes|talk]]) 20:47, 2 June 2012 (UTC)
==Restricted Reference==
Reference 6 is access restricted for unregistered users. Finding a non-restricted source would be appreciated. <span style="font-size: smaller;" class="autosigned">— Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/190.44.82.18|190.44.82.18]] ([[User talk:190.44.82.18|talk]]) 18:14, 24 November 2012 (UTC)</span><!-- Template:Unsigned IP --> <!--Autosigned by SineBot-->
== Ambiguity in runtime ==
In the section for general graphs, the runtime of Edmond's algorithm is stated to be O(V*E).
The article on Edmond's algorithm however states that it needs O(V^4) time.
I think the runtime with O(V*E) is achievable with a different verion of Edmond's algorithm. <small class="autosigned">— Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/141.3.208.9|141.3.208.9]] ([[User talk:141.3.208.9|talk]]) 08:01, 11 February 2016 (UTC)</small><!-- Template:Unsigned IP --> <!--Autosigned by SineBot-->
Perhaps it should be made more clear, but this article is on the Blossom Algorithm, not on Edmonds's Algorithm. Edmonds discovered both, but only the latter is commonly referred to by his name.
[[Special:Contributions/66.134.245.203|66.134.245.203]] ([[User talk:66.134.245.203|talk]]) 19:51, 9 August 2016 (UTC)
== External links modified ==
Hello fellow Wikipedians,
I have just modified one external link on [[Blossom algorithm]]. Please take a moment to review [https://en.wikipedia.org/w/index.php?diff=prev&oldid=791725425 my edit]. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit [[User:Cyberpower678/FaQs#InternetArchiveBot|this simple FaQ]] for additional information. I made the following changes:
*Added archive https://web.archive.org/web/20081230183603/http://www.cs.berkeley.edu/~karp/greatalgo/lecture05.pdf to http://www.cs.berkeley.edu/~karp/greatalgo/lecture05.pdf
When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.
{{sourcecheck|checked=false|needhelp=}}
Cheers.—[[User:InternetArchiveBot|'''<span style="color:darkgrey;font-family:monospace">InternetArchiveBot</span>''']] <span style="color:green;font-family:Rockwell">([[User talk:InternetArchiveBot|Report bug]])</span> 02:54, 22 July 2017 (UTC)
| |||