Parameterized complexity of finding connected induced subgraphs (Q897959)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Parameterized complexity of finding connected induced subgraphs
scientific article

    Statements

    Parameterized complexity of finding connected induced subgraphs (English)
    0 references
    0 references
    0 references
    8 December 2015
    0 references
    parameterized complexity
    0 references
    hereditary properties
    0 references
    connected induced subgraphs
    0 references

    Identifiers

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