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

From MaRDI portal
Revision as of 01:11, 30 January 2024 by Import240129110155 (talk | contribs) (Added link to MaRDI item.)
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