Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems (Q4987442): Difference between revisions
From MaRDI portal
Item:Q4987442
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:40, 8 February 2024
scientific article; zbMATH DE number 7342468
| 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
3 May 2021
0 references
graph-completion problems
0 references
