An NP-complete matching problem (Q1166935): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 03:26, 5 March 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