The computational complexity of disconnected cut and \(2 K_2\)-partition (Q2259853)

From MaRDI portal
Revision as of 18:39, 9 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
The computational complexity of disconnected cut and \(2 K_2\)-partition
scientific article

    Statements

    The computational complexity of disconnected cut and \(2 K_2\)-partition (English)
    0 references
    0 references
    0 references
    5 March 2015
    0 references
    disconnected cut
    0 references
    \(2K_2\)-partition
    0 references
    biclique cover
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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