All public logs

Combined display of all available logs of Algorithm Wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 11:18, 15 February 2023 Admin talk contribs created page Blossom Algorithm (general graph Maximum cardinality matching) (Created page with "== Time Complexity == $O(V^{2}E)$ == Space Complexity == $O(E)$ auxiliary? words (Manipulates a constant number of graphs? Contractions can be kept track of in O(E) space) == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == Yes, == Model of Computation == Word RAM == Year == 1961 == Reference == https://www-cambridge-org.ezproxy.canberra.edu.au/core/journals/canadian-journal-of-mathematics/article/paths-trees-and-flowers/08B492B72...")