Genetic Algorithm Approach to Some Graph Theoretic Problems - Nayeem, Sk. Md. Abu
44,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in 6-10 Tagen
  • Broschiertes Buch

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.…mehr

Andere Kunden interessierten sich auch für
Produktbeschreibung
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.
Autorenporträt
Dr. Sk. Md. Abu Nayeem has obtained his Ph.D. degree in Applied Mathematics from Vidyasagar University, Midnapore - 721 102, India in 2007. He is currently working as an Assistant Professor in the Department of Mathematics at Aliah University, Kolkata, India. His research interest includes Graph Theory, Algorithms, Fuzzy Sets etc.