A las vegas rnc algorithm for maximum matching
- 1 December 1986
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 6 (4) , 387-391
- https://doi.org/10.1007/bf02579264
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Constructing a perfect matching is in random NCCombinatorica, 1986
- A simple parallel algorithm for the maximal independent set problemPublished by Association for Computing Machinery (ACM) ,1985
- A fast parallel algorithm for the maximal independent set problemPublished by Association for Computing Machinery (ACM) ,1984
- On the structure of factorizable graphsActa Mathematica Hungarica, 1972
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965