On the complexity of singly connected vertex deletion (Q2089067)

From MaRDI portal
Revision as of 07:23, 30 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the complexity of singly connected vertex deletion
scientific article

    Statements

    On the complexity of singly connected vertex deletion (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 October 2022
    0 references
    singly connected digraphs
    0 references
    FPT algorithm
    0 references
    kernel
    0 references
    bounded independence number
    0 references
    tournaments
    0 references
    local tournaments
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers