An O(EV log V) algorithm for finding a maximal weighted matching in general graphs
SIAM Journal on Computing
Toughness and Delaunay triangulations
Discrete & Computational Geometry
Solving (large scale) matching problems combinatorially
Mathematical Programming: Series A and B
Data structures for weighted matching and nearest common ancestors with linking
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Implementation of algorithms for maximum matching on nonbipartite graphs.
Implementation of algorithms for maximum matching on nonbipartite graphs.
A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
| Hi-index | 0.00 |
We describe the implementation of an O(nm log n) algorithm for weighted matchings in general graphs. The algorithm is a variant of the algorithm of Galil, Micali, and Gabow [12] and requires the use of concatenable priority queues. No previous implementation had a worst-case guarantee of O(nmlog n). We compare our implementation to the experimentally fastest implementation (called Blossom IV) due to Cook and Rohe [4]; Blossom IV is an implementation of Edmonds' algorithm and has a running time no better than O(n3). Blossom IV requires only very simple data structures. Our experiments show that our new implementation is competitive to Blossom IV.