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, and 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, and heuristic search algorithms.

Скачать книгу бесплатно (djvu, 3.59 Mb)

---

Читать «Combinatorial algorithms. Generation, enumeration, and search»