On finding \(k\)-cliques in \(k\)-partite graphs (Q360493)

From MaRDI portal
Revision as of 19:47, 6 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On finding \(k\)-cliques in \(k\)-partite graphs
scientific article

    Statements

    On finding \(k\)-cliques in \(k\)-partite graphs (English)
    0 references
    27 August 2013
    0 references
    0 references
    maximum clique enumeration problem
    0 references
    \(k\)-partite graph
    0 references
    \(k\)-clique
    0 references
    bit parallelism
    0 references
    0 references
    0 references
    0 references