Efficiently enumerating all maximal cliques with bit-parallelism (Q1651581)
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: Efficiently enumerating all maximal cliques with bit-parallelism |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficiently enumerating all maximal cliques with bit-parallelism |
scientific article |
Statements
Efficiently enumerating all maximal cliques with bit-parallelism (English)
0 references
12 July 2018
0 references
maximal clique
0 references
bitstring
0 references
branch-and-bound
0 references
subgraph enumeration
0 references
combinatorial optimization
0 references
0 references
0 references
