No label defined (Q4234989)

``Combinatorial algorithms. Generation, enumeration, and search'' is an introductory textbook on combinatorial algorithms, but differs from other texts that emphasize graph and network algorithms such as spanning trees, shortest paths, matching, flows, etc. The organization is as follows: Chapter 1. Basics on analysis of algorithms, complexity and data structures. Chapters 2 and 3. The generation of elementary combinatorial objects such as subsets, permutations, partitions, and labeled trees. Chapter 4. Backtracking algorithms. Chapter 5. Heuristics such as hill-climbing, simulated annealing, tabu search and genetic algorithms. Chapters 6 and 7. Algorithms involving permutations groups, in particular as applied to the graph isomorphism problem. Chapter 8. Basis reduction, for problems that can be reduced to finding the shortest vector in a lattice. There are numerous examples. The book is suitable for an upper level undergraduate or a graduate course.