Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering (Q5955469)

From MaRDI portal
Revision as of 09:22, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1704552
Language Label Description Also known as
English
Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering
scientific article; zbMATH DE number 1704552

    Statements

    Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 February 2002
    0 references
    maximum clique
    0 references
    branch and bound
    0 references
    braiding
    0 references

    Identifiers