{"version":"1.0","type":"link","title":"Blossom algorithm - Newikis","description":"In graph theory, the blossom algorithm is an algorithm for constructing maximum matchings on graphs. The algorithm was developed by Jack Edmonds in 1961, and published in 1965. Given a general graph G = (V, E), the algorithm finds a matching M such that each vertex in V is incident with at most one…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}