On the complexity landscape of connected \(f\)-factor problems (Q2414869): 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/s00453-019-00546-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2546840917 / rank | |||
Normal rank | |||
Revision as of 23:16, 19 March 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
