This manuscript provides a comprehensive review of the Maximum Clique Problem, a
computational problem that involves finding subsets of vertices in a graph that are all …

We present the winning solver of the Parameterized Algorithms and Computational
Experiments (PACE) 2019 Challenge, Vertex Cover Track. The minimum vertex cover …

To ensure the ship navigation safety, it is necessary to detect the targets in the background
of sea clutter around the ship. The most commonly used target detection equipments for ship …

In this paper, we single out the following particular case of the clique search problem. The
vertices of the given graph are legally colored with k colors and we are looking for a clique …

We present the winning solver of the PACE 2019 Implementation Challenge, Vertex Cover
Track. The minimum vertex cover problem is one of a handful of problems for which …

Heterogeneous small cell network is one of the most effective solutions to overcome
spectrum scarcity for the next generation of mobile networks. Dual connectivity (DC) can …

It is known that the problem of proper coloring of the nodes of a given graph can be reduced
to finding cliques in a suitably constructed auxiliary graph. In this work, we explore the …

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 …

With the rapid development of science and technology and the improvement of people's
living standards, vehicles have gradually become the main means of travel. The increase in …

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 …