Faster scaling algorithms for general graph matching problems

  title={Faster scaling algorithms for general graph matching problems},
  author={H. Gabow and R. Tarjan},
  journal={J. ACM},
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
Efficient algorithms for maximum weight matchings in general graphs with small edge weights
Scaling Algorithms for Weighted Matching in General Graphs
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching
A Simpler Scaling Algorithm for Weighted Matching in General Graphs
  • Ran Duan
  • Mathematics, Computer Science
  • ArXiv
  • 2014
Faster Scaling Algorithms for Network Problems
Approximating Maximum Weight Matching in Near-Linear Time
  • Ran Duan, Seth Pettie
  • Mathematics, Computer Science
  • 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
  • 2010
Fine-Grained Algorithm Design for Matching
All-Cavity Maximum Matchings