Testing for equality between maximum matching and minimum node covering
- 31 December 1977
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 6 (6) , 199-202
- https://doi.org/10.1016/0020-0190(77)90068-0
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- An O (N2.5) algorithm for maximum matching in general graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965