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…

2016

Let D be a finite digraph, and let V0,⋯,Vk−1 be nonempty subsets of V(D) . The (strong form of) Edmonds' branching theorem states…

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…

2013

2008

A phylogenetic tree represents historical evolutionary relationship between different species or organisms. There are various…

1998

1995

It is well-known that if augmenting paths are used to solve a max flow problem then two problems can arise: 1) the number of…

1994

Given a graph induced by an even number of points on the plane, the minimum weight matching problem calls for finding a pairing…

1991

1981

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