Combinatorial Algorithms:Generation, Enumeration, and Search
组合算法：生成、枚举与搜索
物理学其他学科售 价：
￥
658.00
发货周期：预计5-7周发货
出 版 社
出版时间
2019年12月20日
装 帧
平装
页 码
344
开 本
234x156 mm
语 种
英文
综合评分
暂无评分
- 图书详情
- 目次
- 买家须知
- 书评（0）
- 权威书评（0）
图书简介
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.
Many classical areas are covered as well as new research topics not included in most existing texts, such as:
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.
本书暂无推荐
本书暂无推荐
看了又看
- 上一个
