A Pruning Procedure for Exact Graph Coloring (Q4015385)

From MaRDI portal
Revision as of 21:28, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Pruning Procedure for Exact Graph Coloring
scientific article

    Statements

    title
    A Pruning Procedure for Exact Graph Coloring (English)
    0 references
    author
    Thomas J. Sager
    0 references
    Shi-Jen Lin
    0 references
    publication date
    13 January 1993
    0 references
    zbMATH Keywords
    computational complexity
    0 references
    branch-and-bound
    0 references
    chromatic number
    0 references
    graph coloring
    0 references
    scheduling
    0 references
    NP-hard
    0 references
    graph coloring algorithm
    0 references
    random graphs
    0 references
    search tree
    0 references

    Identifiers

    DOI
    10.1287/ijoc.3.3.226
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    05C15
    0 references
    68Q25
    0 references
    05C80
    0 references
    05C85
    0 references
    68M20
    0 references
    zbMATH DE Number
    85996
    0 references
    OpenAlex ID
    W2012122180
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4015385&oldid=31973061"
    Powered by MediaWiki