A Simpler Scaling Algorithm for Weighted Matching in General Graphs.
Year: 2014
Type: preprint
Abstract: We present a new scaling approach for the maximum weight perfect matching problem in general graphs, with running time O((m + n log n) n log(nN)), where n,m,N denote the number of vertices, number of edges, and largest magnitude of integral costs. Comparing with the complicated long-standing algorithm by [Gabow and Tarjan 1991] of running time O(m n log n log(nN)), our algorithm not only has a better time bound when m = ω(n log n), but is also dramatically simpler to describe and analyze. Our algorithm also matches the time bound O(m n log(nN)) of maximum weight perfect matching for bipartite graphs [Gabow and Tarjan 1989] when m = Ω(n log n). ∗Email:
Source: arXiv (Cornell University)
Author: Ran Duan
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1922780582
