On the complexity of feedback set problems in signed digraphs (Q3503560)

From MaRDI portal
Revision as of 12:19, 11 October 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 feedback set problems in signed digraphs
scientific article

    Statements

    On the complexity of feedback set problems in signed digraphs (English)
    0 references
    0 references
    0 references
    0 references
    5 June 2008
    0 references
    feedback set problems
    0 references
    NP-completeness
    0 references
    signed digraph
    0 references
    regulatory Boolean networks
    0 references

    Identifiers