An exact combinatorial algorithm for minimum graph bisection (Q747771)

From MaRDI portal
Revision as of 04:29, 5 July 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
An exact combinatorial algorithm for minimum graph bisection
scientific article

    Statements

    An exact combinatorial algorithm for minimum graph bisection (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 October 2015
    0 references
    bisection
    0 references
    branch-and-bound
    0 references
    graph partition
    0 references
    combinatorial algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references