Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems (Q4987442): Difference between revisions

From MaRDI portal
Item:Q4987442
Set OpenAlex properties.
Importer (talk | contribs)
Changed an Item
Property / arXiv ID
 
Property / arXiv ID: 1508.05282 / rank
 
Normal rank

Revision as of 19:40, 19 April 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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    3 May 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    graph-completion problems
    0 references
    0 references
    0 references