An NP-complete matching problem (Q1166935)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3770973
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An NP-complete matching problem |
scientific article; zbMATH DE number 3770973 |
Statements
An NP-complete matching problem (English)
0 references
1980
0 references
restricted form of the perfect matching problem for bipartite graphs
0 references
partitions of the vertices of the graph
0 references
degrees of the vertices
0 references
polynomial time algorithm
0 references
