Scholars Central

ArticlePublished 3 May 2019

Graph coloring problem by simulating eurygaster behavior

Authors: Fariborz Ahmadi, Hamid Salehi, Seied veria hoseini

Archives of Applied Science Research

Volume 6 · Issue 4 · Pages 175–178

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

graph coloring problem has been focuse by researchers due to NP-Hard nature. In this article, this problem is solved by simulating the behavior of insect in wheat farms, namely eurygaster. These insects attack to farms and when one farm is disrupted, they attack to other farms in a manner that all farms will be disrupted. On the other hand, graph coloring is a NP-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.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Archives of Applied Science Research.

All its articles

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalArchives of Applied Science Research
  • SubjectComputer Science & IT
  • SubjectGenetics & Molecular Biology
  • SubjectPhysics & Astronomy
  • BylineArticles whose byline prints “Fariborz Ahmadi”
  • BylineArticles whose byline prints “Hamid Salehi”
  • BylineArticles whose byline prints “Seied veria hoseini”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels