Graph theory is a well explored, but still expanding area of mathematics and computer science. Efficient algorithms for graph theoretic problems are of immense practical importance. There are numerous problems in graph theory that are NP-complete, i.e., no efficient algorithms can solve them in polynomial times. Genetic algorithms (GAs) are heuristic search and optimization technique where the search methods mimic some natural phenomena: genetic inheritance and survival of the fittest. In this work, GAs are applied successfully on some well-known NP-complete graph theoretic problems. Some other problems in fuzzy environments are also considered here.
Genetic Algorithm Approach to Some Graph Theoretic Problems: In Crisp and Fuzzy Environments book
Genetic Algorithm Approach to Some Graph Theoretic Problems: In Crisp and Fuzzy Environments book series pdf
Genetic Algorithm Approach to Some Graph Theoretic Problems: In Crisp and Fuzzy Environments by Sk. Md. Abu Nayeem ebook pdf epub mobi
Genetic Algorithm Approach to Some Graph Theoretic Problems: In Crisp and Fuzzy Environments download
No comments:
Post a Comment
Note: Only a member of this blog may post a comment.