An NP-complete matching problem (Q1166935): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:56, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An NP-complete matching problem |
scientific article |
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
