The complexity of clique graph recognition (Q1019185)

From MaRDI portal
Revision as of 20:24, 10 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of clique graph recognition
scientific article

    Statements

    title
    The complexity of clique graph recognition (English)
    0 references
    author
    Liliana Alcón
    0 references
    Luérbio Faria
    0 references
    Marisa Gutierrez
    0 references
    publication date
    28 May 2009
    0 references
    zbMATH Keywords
    clique graphs
    0 references
    NP-complete problems
    0 references
    Helly property
    0 references
    intersection graphs
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q17
    0 references
    05C69
    0 references
    68R10
    0 references
    zbMATH DE Number
    5558990
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1019185&oldid=1292779"
      Powered by MediaWiki