forked from psanse/BITSCAN
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlegal.txt
21 lines (15 loc) · 1.49 KB
/
legal.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
Contents: BITSCAN, a library for managing bit strings, specificacally oriented for fast bit scanning
Relase number: BITSCAN 1.0
Date of release: 21/3/14
Author: pablo san segundo (UPM-CSIC)
URL: https://www.researchgate.net/profile/Pablo_San_Segundo
Platforms: tested on Windows 64 bit and Linux (note 64bit is mandatory)
This library contains a number of optimizations for fast bit scanning in 64 bit computers. It has been used succesfully to implement BBMC, a very fast maximum clique algorithm. BBMC encodes the adjacency matrix as as set of bitstrings and computes the main operations of the search as bit masks.
BBMC has been described in a number of papers. Below are the main references:
[1] Relaxed approximate coloring in exact maximum clique search. Pablo San Segundo, Cristobal Tapia. Computers & Operations Research, 2013
[2] An improved bit parallel exact maximum clique algorithm. Pablo San Segundo, Fernando Matia, Diego Rodriguez-Losada, Miguel Hernando, Optimization Letters 2011.
[3] An exact bit-parallel algorithm for the maximum clique problem.Pablo San Segundo, Diego Rodríguez-Losada, Agustin Jimenez. Computers & Operations Research, 2011
In [4], BBMC was rated fastest at present.
[4] Exact Algorithms for Maximum Clique: A Computational Study. Prosser,P. Algorithms, 2012
LICENCE
The software is distributed for research puposes only as long as papers [1-3] are cited. If you wish to use this software for commercial applications, please contact Pablo San Segundo ([email protected])