On the complexity landscape of connected \(f\)-factor problems (Q4608602)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6851874
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity landscape of connected \(f\)-factor problems |
scientific article; zbMATH DE number 6851874 |
Statements
21 March 2018
0 references
\(f\)-factors
0 references
connected \(f\)-factors
0 references
quasi-polynomial time algorithms
0 references
randomized algorithms
0 references
0.9907653331756592
0 references
0.8502512574195862
0 references
0.8234626650810242
0 references
0.7790523171424866
0 references
0.7587677240371704
0 references
