Maximum directed cuts in graphs with degree constraints (Q1926032)

From MaRDI portal
Revision as of 02:28, 20 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Maximum directed cuts in graphs with degree constraints
scientific article

    Statements

    Maximum directed cuts in graphs with degree constraints (English)
    0 references
    0 references
    0 references
    27 December 2012
    0 references
    maximum directed cut
    0 references
    max cut problem
    0 references
    NP-hard problem
    0 references
    Hall ratio
    0 references
    acyclic digraph
    0 references
    digraphs containing no directed triangles
    0 references
    maximum dicut
    0 references
    directed cut
    0 references
    subcubic graph
    0 references
    triangle-free graph
    0 references

    Identifiers