Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems (Q4575659): Difference between revisions
From MaRDI portal
EloiFerrer (talk | contribs) Merged Item from Q4987442 |
Created claim: Wikidata QID (P12): Q130971035, #quickstatements; #temporary_batch_1733738756918 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q130971035 / rank | |||
Normal rank | |||
Latest revision as of 11:08, 9 December 2024
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
