Exploring the Subexponential Complexity of Completion Problems (Q2828210)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exploring the Subexponential Complexity of Completion Problems |
scientific article |
Statements
Exploring the Subexponential Complexity of Completion Problems (English)
0 references
24 October 2016
0 references
edge completion
0 references
modification
0 references
subexponential parameterized complexity
0 references
0 references
0 references
0 references
0 references
0 references
