Combinatorial Algorithms: Generation Enumeration and Search

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.Additional ISBNs9780367400156, 9781003068006, 9780849339882, 0367400154, 1003068006, 084933988X, 9780367400156Combinatorial Algorithms: Generation, Enumeration, and Search 1st Edition is written by Donald L. Kreher; Douglas R. Stinson and published by CRC Press. ISBNs for Combinatorial Algorithms are 9781000141375, 1000141373 and the print ISBNs are 9780849339882, 084933988X. Additional ISBNs include 0367400154, 1003068006, 084933988X, 9780367400156, 9780367400156, 9781003068006, 9780849339882.