Blossom algorithm

Known as: Edmonds, Edmonds's matching algorithm

The blossom algorithm is an algorithm in graph theory for constructing maximum matchings on graphs. The algorithm was developed by Jack Edmonds in…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2019

Recent progress in animal biometrics has revolutionized wildlife research. Cutting edge techniques allow researchers to track…

2018

Uncertainty is all around us. Constantly-changing circumstances make prediction of future events difficult, if not impossible. On…

2018

In 1988, Vazirani gave an NC algorithm for computing the number of perfect matchings in $K_{3,3}$-minor-free graphs by building…

2017

This paper is devoted to understanding the shortest augmenting path approach for computing a maximum matching. Despite its…

2014

We study the application of Edmond’s Blossom algorithm for unweighted matching on random graphs generated with the Erdos-Renyi…

2013

Consider a 2-D square array of qubits of extent $L\times L$. We provide a proof that the minimum weight perfect matching problem…

2006

We present Edmonds’ blossom shrinking algorithm for finding a maximum cardinality matching in a general graph. En route, we…

1998

1991

1981

We consider the problem of determining the minimum-weight perfect matching of n [even) points on a plane, i.e,, determining how…