Heuristic for rapidly four-coloring large planar graphs (Q1180542)

From MaRDI portal
Revision as of 13:05, 15 May 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
Heuristic for rapidly four-coloring large planar graphs
scientific article

    Statements

    title
    Heuristic for rapidly four-coloring large planar graphs (English)
    0 references
    author
    Craig A. Morgenstern
    0 references
    Henry D. Shapiro
    0 references
    published in
    Algorithmica
    0 references
    publication date
    27 June 1992
    0 references
    zbMATH Keywords
    four-coloring
    0 references
    planar graphs
    0 references
    Kempe chaining
    0 references
    saturation algorithm of Brélaz
    0 references

    Identifiers

    DOI
    10.1007/BF01759077
    0 references
    Mathematics Subject Classification ID
    05C85
    0 references
    68R10
    0 references
    05C15
    0 references
    zbMATH DE Number
    26008
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1180542&oldid=34081383"
    Powered by MediaWiki