Graph coloring problem by simulating eurygaster behavior
Hard problem which by using some huristic method like eurygaster can be solved. The evaluation results show that proposed algorithm is siutble to solve graph coloring problem
Articles, journals and conferences in one search. An exact title, DOI or ISSN is listed first.
In the search box: "exact phrase" · -leave out · OR · prefix* · title: author: journal:
Hard problem which by using some huristic method like eurygaster can be solved. The evaluation results show that proposed algorithm is siutble to solve graph coloring problem
that means it takes a long time to solve. In this paper, by simulating eurygaster life a novel approach has been proposed to solve this problem. These insects divide ... show that proposed approach is more useful and…
Hard problem that has been focused to solve by researchers. On the other hand, eurygaster algorithm is a method invented to solve non-deterministic polynomial by researchers. This algorithm divides
with approximate buckets, 3- genetic algorithm by defining chromosomes as solutions, 4- PSO and anneal simulation. In this research new method based on the eurygaster life is used to find
For authors and organisers
Find the right journal for your paper and submit your manuscript.