On the complexity of all \(( g , f )\)-factors problem (Q2214040)
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: On the complexity of all ( g , f )-factors problem |
scientific article; zbMATH DE number 7282507
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of all \(( g , f )\)-factors problem |
scientific article; zbMATH DE number 7282507 |
Statements
On the complexity of all \(( g , f )\)-factors problem (English)
0 references
4 December 2020
0 references
NP-hardness
0 references
\((g, f)\)-factor
0 references
Tutte's \(f\)-factor theorem
0 references
0.8747496008872986
0 references
0.8646688461303711
0 references
0.8012626767158508
0 references
