Matching is as easy as matrix inversion
- 1 March 1987
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 7 (1) , 105-113
- https://doi.org/10.1007/bf02579206
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A las vegas rnc algorithm for maximum matchingCombinatorica, 1986
- A taxonomy of problems with fast parallel algorithmsInformation and Control, 1985
- Improved processor bounds for algebraic and combinatorial problems in RNCPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Parallel computation for well-endowed rings and space-bounded probabilistic machinesInformation and Control, 1983
- The complexity of restricted spanning tree problemsJournal of the ACM, 1982
- Fast Probabilistic Algorithms for Verification of Polynomial IdentitiesJournal of the ACM, 1980
- Fast Parallel Matrix Inversion AlgorithmsSIAM Journal on Computing, 1976
- Systems of distinct representatives and linear algebraJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965
- The Factorization of Linear GraphsJournal of the London Mathematical Society, 1947