Combinatorial Algorithms:Generation, Enumeration, and Search(Discrete Mathematics and Its Applications)

物理学其他学科

售   价:
1314.00
发货周期:预计5-7周发货
出  版 社
出版时间
1998年12月18日
装      帧
精装
ISBN
9780849339882
复制
页      码
320
开      本
6-1/8 x 9-1/4
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 50 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
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.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个