Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

8 relations
Alexander SchrijverAlgorithmClaw-free graphEdge contraction
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Blossom-Quad: A non-uniform quadrilateral mesh generator using a minimum-cost perfect-matching algorithm
A new indirect way of producing all-quad meshes is presented. The method takes advantage of a wellknown algorithm of the graph… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
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… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Blossom V: a new implementation of a minimum cost perfect matching algorithm
We describe a new implementation of the Edmonds’s algorithm for computing a perfect matching of minimum cost, to which we refer… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Spectral-Driven Isometry-Invariant Matching of 3D Shapes
This paper presents a matching method for 3D shapes, which comprises a new technique for surface sampling and two algorithms for… Expand
  • figure I
  • figure 3
  • figure 8
  • figure 10
  • table I
Is this relevant?
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… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Classical deterministic complexity of Edmonds' Problem and quantum entanglement
Generalizing a decision problem for bipartite perfect matching, J. Edmonds introduced in [14] the problem (now known as the… Expand
Is this relevant?
Highly Cited
1992
Highly Cited
1992
A general approximation technique for constrained forest problems
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of… Expand
  • figure 3
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Algorithmic graph theory
Introduction to graph theory algorithmic techniques shortest paths trees and acyclic diagraphs depth first search connectivity… Expand
  • figure 1-2
  • figure 1-3
  • figure 1-4
  • figure 1-5
  • figure 1-6
Is this relevant?
1988
1988
Composing Bézier simplexes
This paper describes two algorithms for solving the following general problem: Given two polynomial maps f: R<supscrpt><italic>n… Expand
  • figure 1
  • figure 4
  • figure 5
  • figure 7
Is this relevant?
1965
1965
Modification of Edmonds' maximum matching algorithm
Edmonds d e veloped an efficient a lgorithm for finding in a given graph C a mat c hing of maximum cardinality. Thi s algorithm… Expand
  • figure 1
  • figure 5
  • figure 7
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE