Computing the block triangular form of a sparse matrix
ACM Transactions on Mathematical Software (TOMS)
Computing a maximum cardinality matching in a bipartite graph in time On1.5m/logn
Information Processing Letters
3-D Object Recognition Using Bipartite Matching Embedded in Discrete Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Solving unweighted and weighted bipartite matching problems in theory and practice
Solving unweighted and weighted bipartite matching problems in theory and practice
Maximum matchings in sparse random graphs: Karp-Sipser revisited
Random Structures & Algorithms
Greeding matching algorithms, an experimental study
Journal of Experimental Algorithmics (JEA)
Augment or push: a computational study of bipartite matching and unit-capacity flow algorithms
Journal of Experimental Algorithmics (JEA)
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
On Algorithms for Obtaining a Maximum Transversal
ACM Transactions on Mathematical Software (TOMS)
The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem
Proceedings of the 6th International IPCO Conference on Integer Programming and Combinatorial Optimization
Exact scheduling strategies based on bipartite graph matching
EDTC '95 Proceedings of the 1995 European conference on Design and Test
Direct Methods for Sparse Linear Systems (Fundamentals of Algorithms 2)
Direct Methods for Sparse Linear Systems (Fundamentals of Algorithms 2)
Assignment Problems
Heuristic initialization for bipartite matching problems
Journal of Experimental Algorithmics (JEA)
Algorithm 907: KLU, A Direct Sparse Solver for Circuit Simulation Problems
ACM Transactions on Mathematical Software (TOMS)
The university of Florida sparse matrix collection
ACM Transactions on Mathematical Software (TOMS)
Design, implementation, and analysis of maximum transversal algorithms
ACM Transactions on Mathematical Software (TOMS)
GPU accelerated maximum cardinality matching algorithms for bipartite graphs
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
Hi-index | 0.01 |
We investigate the push-relabel algorithm for solving the problem of finding a maximum cardinality matching in a bipartite graph in the context of the maximum transversal problem. We describe in detail an optimized yet easy-to-implement version of the algorithm and fine-tune its parameters. We also introduce new performance-enhancing techniques. On a wide range of real-world instances, we compare the push-relabel algorithm with state-of-the-art algorithms based on augmenting paths and pseudoflows. We conclude that a carefully tuned push-relabel algorithm is competitive with all known augmenting path-based algorithms, and superior to the pseudoflow-based ones.