State space explosion is a fundamental obstacle in formal verification of concurrent systems.
As a solution for this problem, this paper deals with distributed state space. The authors' …

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 …

Graph coloring is an important area of mathematics and computer science. Graph coloring
problem is getting more famous to solve the variety of real-world problems like map coloring …

The verification and validation of IT systems has long been a crucial issue. Used in the most
critical areas, when they are defective, their impact is measured in human lives or colossal …

This chapter examines the graph coloring problem. A graph strict strong coloring algorithm
has been proposed for trees in Haddad and Kheddouci (2009). In this chapter, the authors …

A very promising approach for combinatorial optimization is evolutionary algorithms. As an
application, this paper deals with the strict strong graph coloring problem defined by Haddad …

We consider the state space explosion problem which is a fundamental obstacle in formal
verification of critical systems. In this paper, we propose a fast algorithm for distributing state …

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

We consider the state space explosion problem which is a fundamental obstacle in formal
verification of critical systems. In this paper, we propose a fast algorithm for distributing state …

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 …