On finding \(k\)-cliques in \(k\)-partite graphs (Q360493): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:51, 30 January 2024
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
maximum clique enumeration problem
0 references
\(k\)-partite graph
0 references
\(k\)-clique
0 references
bit parallelism
0 references
