Data Structures for Weighted Matching and Extensions to b-matching and f-factors

@article{Gabow2018DataSF,
  title={Data Structures for Weighted Matching and Extensions to b-matching and f-factors},
  author={Harold N. Gabow},
  journal={ACM Trans. Algorithms},
  year={2018},
  volume={14},
  pages={39:1-39:80}
}
This article shows the weighted matching problem on general graphs can be solved in time <i>O</i>(<i>n</i>(<i>m</i> + <i>n</i> log <i>n</i>)) for <i>n</i> and <i>m</i> the number of vertices and edges, respectively. This was previously known only for bipartite graphs. The crux is a data structure for blossom creation. It uses a dynamic nearest-common-ancestor algorithm to simplify blossom steps, so they involve only back edges rather than arbitrary nontree edges. The rest of the article… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 2 times over the past 90 days. VIEW TWEETS

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Matching Theory. North-Holland, New York

  • L. Lovász, M. D. Plummer
  • ACM Transactions on Algorithms,
  • 1986
Highly Influential
5 Excerpts

Combinatorial Optimization: Networks and Matroids

  • E. L. Lawler
  • 1976
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…