The matching extension problem in general graphs is co-NP-complete (Q1743490): 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 04:30, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The matching extension problem in general graphs is co-NP-complete |
scientific article |
Statements
The matching extension problem in general graphs is co-NP-complete (English)
0 references
13 April 2018
0 references
complexity
0 references
perfect matching
0 references
extendability
0 references