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 …

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 …

In this chapter, we turn our attention to vibrational spectroscopy calculations performed by
molecular dynamics (MD) simulations, that we can also call “finite temperature dynamical …

Abstract The Maximum Common Subgraph (MCS) is a complex theoretical computer
science problem, generalization of the Subgraph Isomorphism problem, finding applications …

In the paper we propose to convert NP-hard combinatorial optimization problems of packing,
covering, and tiling types into maximum or k-clique problems. The key step is to come up …