All Fields
Computer Science
Medicine
FAQ
Contact
Sign in
Blossom algorithm
Known as:
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…Â
(More)
Wikipedia
Topic mentions per year
Topic mentions per year
1973-2018
0
2
4
6
8
1973
2018
Related topics
Related topics
8 relations
Alexander Schrijver
Algorithm
Claw-free graph
Edge contraction
(More)
Related mentions per year
Related mentions per year
1936-2018
1940
1960
1980
2000
2020
Blossom algorithm
Algorithm
Linear programming
Edge contraction
Graph theory
Graph
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Minimum Weight Perfect Matching via Blossom Belief Propagation
Sungsoo Ahn
,
Sejun Park
,
Michael Chertkov
,
Jinwoo Shin
NIPS
2015
Max-product Belief Propagation (BP) is a popular message-passing algorithm for computing a Maximum-A-Posteriori (MAP) assignment…Â
(More)
Is this relevant?
2008
2008
A Fast, Simpler Algorithm for the Matroid Parity Problem
James B. Orlin
IPCO
2008
Consider a matrix with m rows and n pairs of columns. The linear matroid parity problem (LMPP) is to determine a maximum number…Â
(More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Computing Minimum-Weight Perfect Matchings
William J. Cook
,
André Rohe
INFORMS Journal on Computing
1999
We make several observations on the implementation of Edmonds’ blossom algorithm for solving minimum-weight perfectmatching…Â
(More)
Is this relevant?
1999
1999
Implementing Weighted b-Matching Algorithms: Insights from a Computational Study
Matthias Müller-Hannemann
,
Alexander Schwartz
ALENEX
1999
We present an experimental study of an implementation of weighted perfect <i>b</i>-matching based on the primal-dual…Â
(More)
Is this relevant?
1998
1998
Implementing Weighted b-Matching Algorithms: Towards a Flexible Software Design
Matthias Müller-Hannemann
,
Alexander Schwartz
Algorithm Engineering
1998
We present a case study on the design of an implementation of a fundamental combinatorial optimization problem: weighted <i>…Â
(More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
A General Approximation Technique for Constrained Forest Problems
Michel X. Goemans
,
David P. Williamson
SODA
1992
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of…Â
(More)
Is this relevant?
1983
1983
An analysis of alternative strategies for implementing matching algorithms
Michael O. Ball
,
Ulrich Derigs
Networks
1983
In this paper we explore implementation issues related to the solution of the weighted matching problem defined on an undirected…Â
(More)
Is this relevant?
1982
1982
A 1-matching blossom-type algorithm for edge covering problems
Katta G. Murty
,
Clovis Perin
Networks
1982
Let G = (N, A) be a given undirected network where N is a set of n nodes, A is a set of m edges, and c = (cji) is a vector of…Â
(More)
Is this relevant?
1981
1981
Linear-Time Approximation Algorithms for Finding the Minimum-Weight Perfect Matching on a Plane
Masao Iri
,
Kazuo Murota
,
Shouichi Matsui
Inf. Process. Lett.
1981
We consider the problem of determining the minimum-weight perfect matching of n [even) points on a plane, i.e,, determining how…Â
(More)
Is this relevant?
Highly Cited
1973
Highly Cited
1973
Matching, Euler tours and the Chinese postman
Jack Edmonds
,
Ellis L. Johnson
Math. Program.
1973
The solution of the Chinese postman problem using matching theory is given. The convex hull of integer solutions is described as…Â
(More)
Is this relevant?