On Algorithms for Obtaining a Maximum Transversal
- 1 September 1981
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 7 (3), 315-330
- https://doi.org/10.1145/355958.355963
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Algorithm 575: Permutations for a Zero-Free Diagonal [F1]ACM Transactions on Mathematical Software, 1981
- An Implementation of Tarjan's Algorithm for the Block Triangularization of a MatrixACM Transactions on Mathematical Software, 1978
- On Permutations to Block Triangular FormIMA Journal of Applied Mathematics, 1977
- A survey of sparse matrix researchProceedings of the IEEE, 1977
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- On an Approach to Techniques for the Analysis of the Structure of Large Systems of EquationsSiam Review, 1962
- Variants of the hungarian method for assignment problemsNaval Research Logistics Quarterly, 1956
- An Algorithm for Distinct RepresentativesThe American Mathematical Monthly, 1956
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955