The matching extension problem in general graphs is co-NP-complete (Q1743490): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10878-017-0226-x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2775963553 / rank | |||
Normal rank |
Revision as of 00:21, 20 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