Efficiently enumerating all maximal cliques with bit-parallelism
Pablo San Segundo, Jorge Artieda, Darren Strash
| Year of publication: |
April 2018
|
|---|---|
| Authors: | San Segundo, Pablo ; Artieda, Jorge ; Strash, Darren |
| Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 92.2018, p. 37-46
|
| Subject: | Maximal clique | Bitstring | Branch-and-bound | Subgraph enumeration | Combinatorial optimization | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Scheduling-Verfahren | Scheduling problem |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.cor.2017.12.006 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011803767