Combinatorial Algorithms

Combinatorial Algorithms: Generation, Enumeration, and Search thoroughly outlines and analyzes combinatorial algorithms for generation, enumeration, and search applications. It provides a unified and focused collection of 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 Along with classical topics, it covers group algorithms, graph isomorphisms, hill-climbing, and heuristic search algorithms. Accessible without prior study of combinatorics, comprehensive, and including pseudocode descriptions of all algorithms, this handbook also serves as an exceptional textbook for modern coursework.