On finding \(k\)-cliques in \(k\)-partite graphs (Q360493)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On finding \(k\)-cliques in \(k\)-partite graphs |
scientific article; zbMATH DE number 6201756
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On finding \(k\)-cliques in \(k\)-partite graphs |
scientific article; zbMATH DE number 6201756 |
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
0 references
0 references
0 references
