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 …

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 …

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 …

It is known that the legal coloring of the nodes of a given graph can be reduced to a clique
search problem. This paper generalizes this result for hypergraphs. Namely, we will show …

The needs of future digital data and computer systems are expected to be two to three
orders of magnitude larger than for today's systems, to take account of unprecedented …

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 …

Estimating Clique Size via Discarding Subgraphs 1 Introduction 2 Bounding the clique number
Page 1 https://doi.org/10.31449/inf.v45i2.3107 Informatica 45 (2021) 197–204 197 Estimating …

We will describe an algorithm to establish an upper estimate of the clique number of a given
graph. The procedure is based on greedy legal coloring of the nodes. In order to assess the …

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 …