Efficient algorithms for minimum weighted colouring of some classes of perfect graphs (Q1339397)

From MaRDI portal
Revision as of 09:46, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
scientific article

    Statements

    title
    Efficient algorithms for minimum weighted colouring of some classes of perfect graphs (English)
    0 references
    author
    Chính T. Hoàng
    0 references
    publication date
    5 July 1995
    0 references
    zbMATH Keywords
    comparability graph
    0 references
    polynomial algorithm
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05C15
    0 references
    68Q25
    0 references
    zbMATH DE Number
    699144
    0 references
    Wikidata QID
    Q127908552
    0 references
    OpenAlex ID
    W2011254347
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1339397&oldid=37147353"
    Powered by MediaWiki