Finding optimal solutions to the graph partitioning problem with heuristic search (Q2502154)

From MaRDI portal
Revision as of 19:07, 24 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Finding optimal solutions to the graph partitioning problem with heuristic search
scientific article

    Statements

    title
    Finding optimal solutions to the graph partitioning problem with heuristic search (English)
    0 references
    author
    Ariel Felner
    0 references
    publication date
    12 September 2006
    0 references
    describes a project that uses
    DIMACS
    0 references
    JOSTLE
    0 references
    PARTY
    0 references
    Scotch
    0 references
    Chaco
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05C85
    0 references
    68T20
    0 references
    zbMATH DE Number
    5052991
    0 references
    OpenAlex ID
    W2009528260
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2502154&oldid=34888403"
    Powered by MediaWiki