# Faster scaling algorithms for general graph matching problems

@article{Gabow1991FasterSA, title={Faster scaling algorithms for general graph matching problems}, author={H. Gabow and R. Tarjan}, journal={J. ACM}, year={1991}, volume={38}, pages={815-853} }

An algorithm for minimum-cost matching on a general graph with integral edge costs is presented. The algorithm runs in time close to the fastest known bound for maximum-cardinality matching. Specifically, let n, m, and N denote the number of vertices, number of edges, and largest magnitude of a cost, respectively. The best known time bound for maximum-cardinal ity matching M 0( Am). The new algorithm for minimum-cost matching has time bound 0( in a ( m, n )Iog n m log ( nN)). A slightâ€¦Â Expand

#### 305 Citations

Efficient algorithms for maximum weight matchings in general graphs with small edge weights

- Computer Science, Mathematics
- SODA
- 2012

Scaling Algorithms for Weighted Matching in General Graphs

- Computer Science, Mathematics
- SODA
- 2017

A Simpler Scaling Algorithm for Weighted Matching in General Graphs

- Mathematics, Computer Science
- ArXiv
- 2014

Faster Scaling Algorithms for Network Problems

- Mathematics, Computer Science
- SIAM J. Comput.
- 1989

A linear-time approximation algorithm for weighted matchings in graphs

- Mathematics, Computer Science
- TALG
- 2005

Approximating Maximum Weight Matching in Near-Linear Time

- Mathematics, Computer Science
- 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
- 2010

Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs

- Mathematics, Computer Science
- STACS
- 1999