An exact bit-parallel algorithm for the maximum clique problem
Year of publication: |
2011
|
---|---|
Authors: | San Segundo, Pablo ; Rodríguez-Losada, Diego ; Jiménez, Agustín |
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. 38.2011, 2, p. 571-581
|
Subject: | Algorithmus | Algorithm | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound | Scheduling-Verfahren | Scheduling problem |
-
Ozturk, Onur, (2017)
-
Srirangacharyulu, B., (2013)
-
Morrison, David Robert, (2014)
- More ...
-
A new DSATUR-based algorithm for exact vertex coloring
San Segundo, Pablo, (2012)
-
Relaxed approximate coloring in exact maximum clique search
San Segundo, Pablo, (2014)
-
A new exact maximum clique algorithm for large and massive sparse graphs
San Segundo, Pablo, (2016)
- More ...