<i>hClique</i>: An exact algorithm for maximum clique problem in uniform hypergraphs (Q4597964)

From MaRDI portal
Revision as of 21:29, 14 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6818820
Language Label Description Also known as
English
<i>hClique</i>: An exact algorithm for maximum clique problem in uniform hypergraphs
scientific article; zbMATH DE number 6818820

    Statements

    title
    <i>hClique</i>: An exact algorithm for maximum clique problem in uniform hypergraphs (English)
    0 references
    publication date
    14 December 2017
    0 references
    zbMATH Keywords
    uniform hypergraphs
    0 references
    maximum clique problem
    0 references

    Identifiers

    zbMATH DE Number
    6818820
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4597964&oldid=36362155"
    Powered by MediaWiki