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.
Taschenbuch - 9783848497249 Verlag: LAP Lambert Academic Publishing Ersterscheinung: Mai 2012 ISBN-13: 9783848497249 Größe: 220 mm x 150 mm x 12 mm Gewicht: 314 Gramm 200 Seiten Versandfertig in 3-5 Tagen.