On Algorithms for Obtaining a Maximum Transversal
ACM Transactions on Mathematical Software (TOMS)
Algorithm 575: Permutations for a Zero-Free Diagonal [F1]
ACM Transactions on Mathematical Software (TOMS)
A graph partitioning algorithm by node separators
ACM Transactions on Mathematical Software (TOMS)
Computing the block triangular form of a sparse matrix
ACM Transactions on Mathematical Software (TOMS)
Fast and effective algorithms for graph partitioning and sparse-matrix ordering
IBM Journal of Research and Development - Special issue: optical lithography I
A software package for sparse orthogonal factorization and updating
ACM Transactions on Mathematical Software (TOMS)
Max-matching diversity in OFDMA systems
IEEE Transactions on Communications
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.00 |
We examine an implementation and a number of modifications of a 1973 algorithm of Hopcroft and Karp for permuting a sparse matrix so that there are no zeros on the diagonal. We describe our implementation of the original Hopcroft and Karp algorithm and compare this with modifications which we prove to have the same O(n1/2&tgr;) behavior, where the matrix is of order n with &tgr; entries. We compare the best of these with an efficient implementation of an algorithm whose worst-case behavior is O(n&tgr;).