Genetic Algorithms And The Optimization Problems In Graph Theory - Softcover

Bogdanović, Milena

Softcover

ISBN 10: 3659353299 ISBN 13: 9783659353291

Publisher: LAP LAMBERT Academic Publishing, 2013

Synopsis

Graph theory, as modern and young branches of mathematics, studies graphs which are abstract mathematical objects. The use of graph models for description or data structures is very common. Investigation of algorithms to solve problems using graph, is a very important part of computer science. The genetic algorithms represent a family of algorithms using some of genetic principles being present in nature, in order to solve particular computational problems. These natural principles are: inheritance, crossover, mutation, survival of the fittest, migrations and so on. The problems degree-limited graph of nodes considering the weight of the vertex or weight of the edges, with the aim to find the optimal weighted graph in terms of certain restrictions on the degree of the vertices in the subgraph. This class of combinatorial problems was extensively studied because of the implementation and application in network design, connection of networks and routing algorithms. It is likely that solution of MDBCS problem will find its place and application in these areas.

About this title

About the Author

Milena Bogdanović is the assistant professor at the Teacher Training Faculty in Vranje, University of Niš, Serbia (major in Mathematics and Informatics – Mathematics 1, Mathematics 2, Elementary mathematical concepts, IT in Education, Educational technology, Elements of mathematics).She is the Reviewer of several international journals.

Edition details

• Publisher: LAP LAMBERT Academic Publishing
• Publication date: 2013
• Language: English
• ISBN 10: 3659353299
• ISBN 13: 9783659353291
• Binding: Paperback
• Number of pages: 72