On the complexity of the 3-kernel problem in some classes of digraphs (Q2442275)

From MaRDI portal
Revision as of 15:15, 4 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the complexity of the 3-kernel problem in some classes of digraphs
scientific article

    Statements

    On the complexity of the 3-kernel problem in some classes of digraphs (English)
    0 references
    0 references
    0 references
    2 April 2014
    0 references
    kernel
    0 references
    3-kernel
    0 references
    NP-completeness
    0 references
    multipartite tournament
    0 references
    cyclically 3-partite digraphs
    0 references
    k-quasi-transitive digraph
    0 references

    Identifiers