A systolic array for the assignment problem
- 1 January 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 37 (11) , 1422-1425
- https://doi.org/10.1109/12.8709
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A systolic array algorithm for the algebraic path problem (shortest paths; Matrix inversion)Computing, 1985
- An algorithm for then×n optimum assignment problemBIT Numerical Mathematics, 1979
- A note on shortest path, assignment, and transportation problemsNaval Research Logistics Quarterly, 1963
- Algorithm 97: Shortest pathCommunications of the ACM, 1962
- A Theorem on Boolean MatricesJournal of the ACM, 1962
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955