AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs (Q4373007)

From MaRDI portal
Revision as of 20:14, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1098605
Language Label Description Also known as
English
AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs
scientific article; zbMATH DE number 1098605

    Statements

    title
    AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs (English)
    0 references
    author
    Binay K. Bhattacharya
    0 references
    D. Kaller
    0 references
    publication date
    25 May 1998
    0 references
    zbMATH DE Number
    1098605
    0 references
    zbMATH Keywords
    circular-arc graphs
    0 references
    OpenAlex ID
    W1982667852
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4373007&oldid=31494042"
    Powered by MediaWiki