The strict strong coloring based graph distribution algorithm
N Guidoum, M Bensouyad… - International Journal of …, 2013 - igi-global.com
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' …
As a solution for this problem, this paper deals with distributed state space. The authors' …
A new and fast evolutionary algorithm for strict strong graph coloring problem
M Bensouyad, N Guidoum, DE Saïdouni - Procedia Computer Science, 2015 - Elsevier
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 …
aims at finding the minimum number of colors where each vertex dominates at least one non …
[PDF][PDF] Study of algorithm for coloring in various graph
A Malviya, B Agrawal, SKA Mansuri - 2022 - mathsjournal.com
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 …
problem is getting more famous to solve the variety of real-world problems like map coloring …
[PDF][PDF] New fault-tolerant approaches for the distributed state space generation in dynamic environment
A Agab, MK Touhami, I Bensetira - academia.edu
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 …
critical areas, when they are defective, their impact is measured in human lives or colossal …
A generalized graph strict strong coloring algorithm: Application on graph distribution
M Bensouyad, M Bouzenada, N Guidoum… - Contemporary …, 2014 - igi-global.com
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 …
has been proposed for trees in Haddad and Kheddouci (2009). In this chapter, the authors …
An Efficient Evolutionary Algorithm for Strict Strong Graph Coloring Problem
M Bensouyad, N Guidoum… - International Journal of …, 2014 - igi-global.com
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 …
application, this paper deals with the strict strong graph coloring problem defined by Haddad …
A New and Fast Variant of the Strict Strong Coloring Based Graph Distribution Algorithm
N Guidoum, M Bensouyad, DE Saïdouni - Software Engineering Research …, 2016 - Springer
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 …
verification of critical systems. In this paper, we propose a fast algorithm for distributing state …
Strict Strong Graph Coloring: Algorithms and Applications
M Bensouyad, N Guidoum, DE Saidouni - Proceedings of the The …, 2015 - dl.acm.org
This paper addresses a recent combinatorial optimization problem called the Strict Strong
graph coloring. This new coloring parameter investigates the use of dominance relation …
graph coloring. This new coloring parameter investigates the use of dominance relation …
A new and fast variant of the strict strong coloring based graph distribution algorithm
N Guidoum, M Bensouyad… - 2015 IEEE/ACIS 16th …, 2015 - ieeexplore.ieee.org
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 …
verification of critical systems. In this paper, we propose a fast algorithm for distributing state …
[PDF][PDF] Université Abdelhamid Mehri
M BENSOUYAD - 2015 - univ-constantine2.dz
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 …
vertices of a graph by a minimum number of colors called the chromatic number such that no …