Efficiently enumerating all maximal cliques with bit-parallelism (Q1651581): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2017.12.006 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2017.12.006 / rank | |||
Normal rank | |||
Latest revision as of 01:03, 11 December 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
0 references
0 references
