An exact combinatorial algorithm for minimum graph bisection (Q747771): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978857010 / rank
 
Normal rank

Revision as of 01:16, 20 March 2024

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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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