Parameterized complexity of superstring problems (Q1679230)
From MaRDI portal
(Redirected from Item:Q2942248)
| 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: Parameterized complexity of superstring problems |
scientific article; zbMATH DE number 6473970
- Parameterized Complexity of Superstring Problems
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized complexity of superstring problems |
scientific article; zbMATH DE number 6473970 |
|
Statements
Parameterized complexity of superstring problems (English)
0 references
Parameterized Complexity of Superstring Problems (English)
0 references
9 November 2017
0 references
20 August 2015
0 references
shortest superstring
0 references
parameterized complexity
0 references
kernelization
0 references
0.9976403713226318
0 references
0.8264835476875305
0 references
0.8257893323898315
0 references