The blossom algorithm is an algorithm in graph theory for constructing maximum matchings on graphs. The algorithm was developed by Jack Edmonds inâ€¦Â (More)

(More)

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

- 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

- 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

- 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

- 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

- 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

- 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

- 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

- 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

- 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

- 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?