Genetic Algorithm Approach to Some Graph Theoretic Problems

By Sk. Md. Abu Nayeem

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. This description may be from another edition of this product.

• Format: Paperback
• Language: English
• ISBN: 3848497247
• ISBN13: 9783848497249
• Release Date: April 2012
• Publisher: LAP Lambert Academic Publishing
• Length: 200 Pages
• Weight: 0.66 lbs.
• Dimensions: 0.5" x 6.0" x 9.0"