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

From MaRDI portal
Revision as of 21:49, 18 April 2024 by Importer (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Algorithms parameterized by vertex cover and modular width, through potential maximal cliques
scientific article

    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