The matching extension problem in general graphs is co-NP-complete (Q1743490)
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: The matching extension problem in general graphs is co-NP-complete |
scientific article; zbMATH DE number 6859592
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The matching extension problem in general graphs is co-NP-complete |
scientific article; zbMATH DE number 6859592 |
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
0.89624697
0 references
0.88426274
0 references
0.88020337
0 references
0.8747927
0 references
0.8729646
0 references
0.8726301
0 references
