Benchmark Problems for Exhaustive Exact Maximum Clique Search Algorithms 1
Preliminaries Page 1 https://doi.org/10.31449/inf.v43i2.2678 Informatica 43 (2019) 177–186 …

A. Coloring the nodes of a graph is a widely used technique to speed up practical clique
search algorithms. This motivates our interest in various graph coloring schemes. Because …

The maximum clique problems calls for determining the size of the largest clique in a given
graph. This graph problem affords a number of zero-one linear programming formulations. In …

To carry out a clique search in a given graph in a parallel fashion, one divides the problem
into a very large number of smaller instances. To sort out as many resulted smaller problems …

One of the traditional ways of solving the maximum common induced subgraph problem is
by reduction to a maximum clique problem. The two input graphs, in which the maximum …

In a typical maximum clique search algorithm when optimality testing is inconclusive a
forking takes place. The instance is divided into smaller ones. This is the branching step of …

Our thesis work is focused on discrete optimization problems, and specifically on problems
represented by graphs. These problems emerge in various applications, and form an …

The ever-increasing presence of digital data and computers requires pushing for new levels
of scalability and sustainability of computing systems in order to address the huge data and …

DA Knuth has pointed out that the size and the profile of the search tree associated with a
given back-track algorithm can reasonably be well estimated by certain random exploration …

It is well known that coloring the nodes can be used to establish upper bounds for the clique
number of a graph which in turn can be used to speed up practical clique search algorithms …