On the complexity landscape of connected \(f\)-factor problems (Q2414869): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-019-00546-z / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-019-00546-Z / rank | |||
Normal rank | |||
Latest revision as of 12:08, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity landscape of connected \(f\)-factor problems |
scientific article |
Statements
On the complexity landscape of connected \(f\)-factor problems (English)
0 references
17 May 2019
0 references
connected \(f\)-factors
0 references
quasi-polynomial time algorithms
0 references
randomized algorithms
0 references
NP-intermediate
0 references
exponential time hypothesis
0 references
0 references
