Highly Influenced

4 Excerpts

@article{Kolmogorov2009BlossomVA, title={Blossom V: a new implementation of a minimum cost perfect matching algorithm}, author={Vladimir Kolmogorov}, journal={Math. Program. Comput.}, year={2009}, volume={1}, pages={43-67} }

- Published in Math. Program. Comput. 2009
DOI:10.1007/s12532-009-0002-8

We describe a new implementation of the Edmonds’s algorithm for computing a perfect matching of minimum cost, to which we refer as Blossom V. A key feature of our implementation is a combination of two i deas that were shown to be effective for this problem: the “variable dual up dates” approach of Cook and Rohe [8] and the use of priority queues. We achieve this by maintaining an auxiliar y graph whose nodes correspond to alternating trees in the Edmonds’s algorithm. While our use of priority… CONTINUE READING

SHOWING 1-10 OF 162 CITATIONS, ESTIMATED 24% COVERAGE

Highly Influenced

4 Excerpts

Highly Influenced

7 Excerpts

Highly Influenced

4 Excerpts

Highly Influenced

6 Excerpts

Highly Influenced

6 Excerpts

Highly Influenced

4 Excerpts

Highly Influenced

7 Excerpts

Highly Influenced

5 Excerpts

Highly Influenced

6 Excerpts

Highly Influenced

4 Excerpts

**17**Highly Influenced Citations**Averaged 21 Citations**per year over the last 3 years

SHOWING 1-10 OF 29 REFERENCES

Highly Influential

9 Excerpts

Highly Influential

9 Excerpts

Highly Influential

4 Excerpts

Highly Influential

12 Excerpts

Highly Influential

4 Excerpts

Highly Influential

4 Excerpts

Highly Influential

5 Excerpts

Highly Influential

7 Excerpts

Highly Influential

3 Excerpts

Highly Influential

5 Excerpts

Loading similar papers…