Blossom algorithm
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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?