Graphs are universal modeling tools. They are used to represent objects and their
relationships in almost all domains: they are used to represent DNA, images, videos, social …

Kites are huge archaeological structures of stone visible from satellite images. Because of
their important number and their wide geographical distribution, automatic recognition of …

This paper tackles the strict strong graph coloring (SSColoring). This graph coloring task
aims at finding the minimum number of colors where each vertex dominates at least one non …

Graphs are powerful mathematical modeling tools used in various fields of computer
science, in particular, in Pattern Recognition. Graph matching is the main operation in …

During the last decade, business processes have gained in popularity leading to a rapid
proliferation of business process model collections. The need for efficient and fast systems …

Due to the overlapped region and image size of the input image pair is unpredictable, it
makes the matching procedure more difficult and unstable. For the purpose of finding out the …

Due to the concrete crack images are self-similarity in the contents, it makes the matching
procedure more difficult and unstable than the others. For the purpose of finding out the …

The deformation of the location of structural systems is an important step to predict the
performance of the system under different conditions. In bridges, the plastic deformations …

This paper addresses a recent combinatorial optimization problem called the Strict Strong
graph coloring. This new coloring parameter investigates the use of dominance relation …

Vertex coloring is one of the most studied problems in graph theory. It consists of coloring
vertices of a graph by a minimum number of colors called the chromatic number such that no …