sebalamm / quick-cliques Goto Github PK

Author: Darren Strash (e-mail: first name DOT last name AT gmail DOT com)

Copyright (c) 2011 Darren Strash. This code is released under the GNU Public License (GPL) 3.0.

To read the GPL 3.0, read the file COPYING in this directory.

This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with this program.  If not, see <http://www.gnu.org/licenses/>

----

Quick Cliques: A package to efficiently compute all maximal cliques in sparse graphs

The purpose of this software package is to provide fast algorithms for
listing all maximal cliques.

The original intent was to provide exact reproducibility of experimental results from 
two papers:

Listing All Maximal Cliques in Large Sparse Real-World Graphs
D. Eppstein and D. Strash
Proceedings of the 10th International Conference on Experimental Algorithms (SEA 2011), 
LNCS vol. 6630, pp. 403-414.
doi:10.1007/978-3-642-20662-7_31
arXiv:1103.0318

Listing All Maximal Cliques in Large Sparse Real-World Graphs in Near-Optimal Time
D. Eppstein, M. Löffler, and D. Strash
Journal of Experimental Algorithmics 18 (3): 3.1, 2013
doi:10.1145/2543629

However, this package is now becoming more general purpose, and therefore the experimental
reults in those papers are less likely to be reproducible with the current implementation. 
For algorithm implementations details, see the above papers. For the exact code
used in those experiments, see release v1.0 of this package.

This package includes:
    o C++ code for four implementations for enumerating all maximal cliques of a graph
    o The complete doxygen-generated documentation of the code (see ./doc)
    o A small set of data used for testing (see ./data)
      [ For a larger set of data (too large for GitHub), you can download the following:
        http://www.ics.uci.edu/~dstrash/data.tar.gz ]
    o The test script used to build and run the . (./test.sh)

For instructions on how to use this program see doc/index.html

Or, just type `make' in the terminal, and then execute test.sh.

Please feel free to contact me with any questions!

Darren Strash (e-mail: first name DOT last name AT gmail DOT com)