Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering (Q5955469): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: TABARIS / rank | |||
Normal rank | |||
Revision as of 00:39, 28 February 2024
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
13 February 2002
0 references
maximum clique
0 references
branch and bound
0 references
braiding
0 references
