A linear-time algorithm for clique-coloring problem in circular-arc graphs (Q512872)

From MaRDI portal
Revision as of 12:52, 13 July 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
A linear-time algorithm for clique-coloring problem in circular-arc graphs
scientific article

    Statements

    title
    A linear-time algorithm for clique-coloring problem in circular-arc graphs (English)
    0 references
    author
    Zuosong Liang
    0 references
    Erfang Shan
    0 references
    Yu-Zhong Zhang
    0 references
    publication date
    3 March 2017
    0 references
    zbMATH DE Number
    6691089
    0 references
    zbMATH Keywords
    clique coloring
    0 references
    circular-arc graph
    0 references
    linear time algorithm
    0 references
    OpenAlex ID
    W1084827881
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q512872&oldid=36309095"
    Powered by MediaWiki