商品簡介
An introduction to the most important combinatorial algorithmic techniques. Provides coverage of classical areas in the discipline as well as new research topics such as group algorithms, graph isomorphism, hill-climbing, and heuristic search algorithms. Also covers backtracking and heuristic search methods as applied to various combinatorial structures such as combinations, permutations, graphs, and designs. Intended for students of mathematics, electrical engineering, and computer science who have not necessarily had a prior course on combinatorics. Annotation c. by Book News, Inc., Portland, Or.
