On the complexity landscape of connected \(f\)-factor problems (Q2414869): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:35, 2 February 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
