Finding a Maximum Clique in an Arbitrary Graph (Q3741641)

From MaRDI portal
Revision as of 16:22, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/siamcomp/BalasY86, #quickstatements; #temporary_batch_1731508824982)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Finding a Maximum Clique in an Arbitrary Graph
scientific article

    Statements

    title
    Finding a Maximum Clique in an Arbitrary Graph (English)
    0 references
    author
    Egon Balas
    0 references
    Chang-Sung Yu
    0 references
    publication date
    1986
    0 references
    zbMATH Keywords
    vertex packing
    0 references
    triangulated subgraphs
    0 references
    k-chromatic subgraphs
    0 references
    implicit enumeration
    0 references
    maximum clique
    0 references

    Identifiers

    DOI
    10.1137/0215075
    0 references
    Mathematics Subject Classification ID
    05C35
    0 references
    68R10
    0 references
    05-04
    0 references
    zbMATH DE Number
    3974983
    0 references
    Wikidata QID
    Q56210390
    0 references
    OpenAlex ID
    W2043005464
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3741641&oldid=37908838"
    Powered by MediaWiki