An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph (Q3790662)

From MaRDI portal
Revision as of 22:19, 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
An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph
scientific article

    Statements

    title
    An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph (English)
    0 references
    DOI
    10.1137/0217003
    0 references
    author
    Sumio Masuda
    0 references
    Kazuo Nakajima
    0 references
    publication date
    1988
    0 references
    zbMATH DE Number
    4055070
    0 references
    zbMATH Keywords
    optimal algorithm
    0 references
    maximum independent set
    0 references
    circular-arc graph
    0 references
    OpenAlex ID
    W2071867466
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3790662&oldid=31944611"
    Powered by MediaWiki