The complexity of multicut and mixed multicut problems in (di)graphs (Q391767)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The complexity of multicut and mixed multicut problems in (di)graphs
scientific article

    Statements

    The complexity of multicut and mixed multicut problems in (di)graphs (English)
    0 references
    0 references
    0 references
    13 January 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    multicut
    0 references
    mixed graphs
    0 references
    mixed problem
    0 references
    dichotomy
    0 references
    NP-complete
    0 references
    feedback arc set
    0 references
    0 references