An exact combinatorial algorithm for minimum graph bisection (Q747771)

From MaRDI portal
Revision as of 03:00, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(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

    title
    An exact combinatorial algorithm for minimum graph bisection (English)
    0 references
    author
    Daniel Delling
    0 references
    Daniel Fleischman
    0 references
    Andrew V. Goldberg
    0 references
    Ilya Razenshteyn
    0 references
    Renato F. Werneck
    0 references
    publication date
    19 October 2015
    0 references
    zbMATH Keywords
    bisection
    0 references
    branch-and-bound
    0 references
    graph partition
    0 references
    combinatorial algorithms
    0 references
    describes a project that uses
    KaFFPa
    0 references
    PT-Scotch
    0 references
    DibaP
    0 references
    JOSTLE
    0 references
    SteinLib
    0 references
    KaHIP
    0 references
    Scotch
    0 references
    DIMACS
    0 references
    Biq Mac
    0 references
    DryadOpt
    0 references
    Pregel
    0 references
    cites work
    SHARC
    0 references
    Q3182199
    0 references
    Q4198056
    0 references
    Q5465120
    0 references
    Q3574261
    0 references
    Min-cut clustering
    0 references
    Q3574259
    0 references
    Q3549709
    0 references
    Algorithms - ESA 2003
    0 references
    Q4796190
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C27
    0 references
    90C35
    0 references
    90C57
    0 references
    05C85
    0 references
    zbMATH DE Number
    6495758
    0 references
    OpenAlex ID
    W1978857010
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q747771&oldid=38473540"
    Powered by MediaWiki