CliMax version 1.0
=======================
NAME:
Maximal Clique Computation Tool
DESCRIPTION:
Given an adjacency list the program computes all maximal cliques in a
given graph (set of graphs)
SYNOPSIS:
#include<vector>
#include<Graph.hpp>
#include<Clique.hpp>
/* Constructor */
/*NOTE: parent -> vector<int|long|double>, child -> vector<int|long|double> */
CliMax<int|long|double> clique(parent, child, 3);
/* Compute Maximal Cliques */
clique.ComputeMaxCliques();
/* Get Maximal cliques */
vector<vector<int|long|double>> mc = clique.GetMaxCliques();
/* mc contains vector of vertices of a given maximal clique */
CONSTRUCTION AND RUNTIME COMPLEXITY:
Worst case for n = |V| (number of vertices):
O(3^(n/3))
ACKNOWLEDGMENTS:
Tomita, E.,Tanaka, A. and Takahashi, H. The wrst-case time complexity
for generating all maximal cliques and computational experiments. (2006)
Theor. Comput. Sci. 363:28-42
AUTHOR:
Robert Bakaric <rbakaric@irb.hr>, <bakaric@evolbio.mpg.de>
COPYRIGHT AND LICENSE:
* Copyright 2015 Robert Bakaric
*
* 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 2 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, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
* MA 02110-1301, USA.