Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems (Q4575659)
From MaRDI portal
(Redirected from Item:Q4987442)
scientific article; zbMATH DE number 7342468
- Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems |
scientific article; zbMATH DE number 7342468 |
|
Statements
Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems (English)
0 references
Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems (English)
0 references
16 July 2018
0 references
3 May 2021
0 references
graph-completion problems
0 references
