Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Partitioning planar graphs: a fast combinatorial approach for max-cut
scientific article

    Statements

    Partitioning planar graphs: a fast combinatorial approach for max-cut (English)
    0 references
    0 references
    0 references
    10 July 2012
    0 references
    maximum cut
    0 references
    planar graph
    0 references
    perfect matching
    0 references
    Kasteleyn city
    0 references
    T-join
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers