NP-completeness of some generalizations of the maximum matching problem
- 19 August 1982
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 15 (1), 14-19
- https://doi.org/10.1016/0020-0190(82)90077-1
Abstract
No abstract availableThis publication has 1 reference indexed in Scilit:
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976