Win-win kernelization for degree sequence completion problems (Q295647)
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: Win-win kernelization for degree sequence completion problems |
scientific article; zbMATH DE number 6592917
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Win-win kernelization for degree sequence completion problems |
scientific article; zbMATH DE number 6592917 |
Statements
Win-win kernelization for degree sequence completion problems (English)
0 references
13 June 2016
0 references
computational complexity
0 references
NP-hardness
0 references
polynomial problem kernels
0 references
\(f\)-factors
0 references
lower bounds for problem kernels
0 references
data reduction
0 references
0.9496409893035888
0 references
0.7870067954063416
0 references
0.7795580625534058
0 references
0.7776818871498108
0 references
0.7665924429893494
0 references
