Blossom V: a new implementation of a minimum cost perfect matching algorithm

@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}
}
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
BETA

Citations

Publications citing this paper.
SHOWING 1-10 OF 162 CITATIONS, ESTIMATED 24% COVERAGE

FILTER CITATIONS BY YEAR

2009
2019

CITATION STATISTICS

  • 17 Highly Influenced Citations

  • Averaged 21 Citations per year over the last 3 years

References

Publications referenced by this paper.
SHOWING 1-10 OF 29 REFERENCES

An O(EV log V) algorithm for finding a maximal weighted matching in general graphs

  • H. Gabow Z. Galil, S. Micali
  • SIAM J. Computing,
  • 1986
Highly Influential
7 Excerpts

Algorithms for Maximum Matching on Nonbipartite Graphs

  • H. Gabow.Implementation
  • PhD thesis, Stanford University,
  • 1973
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…