Efficiently enumerating all maximal cliques with bit-parallelism (Q1651581): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:28, 1 February 2024
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
