NP-completeness of some generalizations of the maximum matching problem (Q1168728)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: NP-completeness of some generalizations of the maximum matching problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-completeness of some generalizations of the maximum matching problem |
scientific article |
Statements
NP-completeness of some generalizations of the maximum matching problem (English)
0 references
1982
0 references
computational complexity
0 references
NP-completeness
0 references
communication network testing
0 references
