A range-compaction heuristic for graph coloring (Q1430046)

From MaRDI portal
Revision as of 04:19, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A range-compaction heuristic for graph coloring
scientific article

    Statements

    title
    A range-compaction heuristic for graph coloring (English)
    0 references
    author
    Andrea Di Blas
    0 references
    Richard Hughey
    0 references
    Arun K. Jagota
    0 references
    publication date
    27 May 2004
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    68T20
    0 references
    05C15
    0 references
    zbMATH DE Number
    2069076
    0 references
    zbMATH Keywords
    graph coloring
    0 references
    iterative-greedy algorithm
    0 references
    DIMACS benchmarks
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1430046&oldid=26224446"
    Powered by MediaWiki