This textbook thoroughly outlines combinatorial algorithms for generation, enumeration, and search. Topics include backtracking and heuristic search methods applied to various combinatorial structures, such as:·Combinations·Permutations·Graphs·Designs·Many classical areas are covered as well as new research topics not included in most existing texts, such as:·Group algorithms·Graph isomorphism·Hill-climbing·Heuristic search algorithms·This work serves as an exceptional textbook for a modern course in combinatorial algorithms, providing a unified and focused collection of recent topics of interest in the area. The authors, synthesizing material that can only be found scattered through many different sources, introduce the most important combinatorial algorithmic techniques - thus creating an accessible, comprehensive text that students of mathematics, electrical engineering, and computer science can understand without needing a prior course on combinatorics.

Скачать книгу бесплатно (djvu, 2.09 Mb)   |  Читать «Combinatorial Algorithms: Generation, Enumeration, and Search »