Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
Alexander SchrijverAlgorithmClaw-free graphEdge contraction

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Optimal User Pairing in Cache-Based NOMA Systems with Index Coding
The user pairing problem for cache-based time-slotted non-orthogonal multiple access (NOMA) system with index coding is… 
2016
2016
Throughput characterization of node-based scheduling in multihop wireless networks: a novel application of the Gallai-Edmonds structure theorem
Maximum Vertex-weighted Matching (MVM) is an important link scheduling algorithm for multihop wireless networks. Under certain… 
2016
2016
Edmonds' Branching Theorem in Digraphs Without Forward‐Infinite Paths
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… 
2015
2015
Perfect Matching Quad Layouts for Manifold Meshes
This paper introduces a new approach to automatically generate pure quadrilateral patch layouts on manifold meshes. The algorithm… 
2012
2012
Characterization of removable elements with respect to having k disjoint bases in a matroid
The well-known spanning tree packing theorem of Nash-Williams and Tutte characterizes graphs with k edge-disjoint spanning trees… 
2011
2011
Paths, Flowers and Vertex Cover
It is well known that in a bipartite (and more generally in a Konig) graph, the size of the minimum vertex cover is equal to the… 
2008
2008
Isometry-invariant Matching of Point Set Surfaces
Shape deformations preserving the intrinsic properties of a surface are called isometries. An isometry deforms a surface without… 
2006
2006
On the Bipartite Unique Perfect Matching Problem
In this note, we give tighter bounds on the complexity of the bipartite unique perfect matching problem, bipartite-UPM. We show… 
1992
1992
Coflow polyhedra
1979
1979
A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)