Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Changed label, description and/or aliases in en, and other parts
description / endescription / en
scientific article

Revision as of 13:58, 2 May 2024

No description defined
Language Label Description Also known as
English
Algorithms parameterized by vertex cover and modular width, through potential maximal cliques
No description defined

    Statements

    Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 May 2018
    0 references
    parametrized algorithms
    0 references
    potential maximal cliques
    0 references
    treewidth
    0 references
    vertex cover
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references