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 …

The way we tackle NP-hard problems in practical setting has experienced a major shift in
recent years. Our view has became more sophisticated with the emergence of the …

In this paper we present preliminary results for a fast parallel adaptation of the well-known k-
means clustering algorithm to graphs. We are going to use our method to detect …

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 …

[6] Sousa L, Kropf P, Kuonene P, et al. A roadmap for research in sustainable ultrascale
systems. University Carlos III of Madrid; 2017. Available from: https://www. irit. fr/∼ Georges …

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 …

Numerous fissures, joints and faults exist widely in natural rock masses which played an
important role in the geotechnical engineering. Experimental and numerical methods are …