株式会社極東書店トップ ＞ 商品一覧 ＞ Combinatorial Algorithms : Generation, Enumeration, and Search.
商品詳細
Combinatorial Algorithms : Generation, Enumeration, and Search.
・ISBN 978-0-8493-3988-2 hard GB£ 145.99
￥46,249.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
お気に入り
★★★
電子版あり 大学・学術機関向け電子ブック（eBook）ISBN 978-1-003-06800-6
| 著者・編者 | Kreher, Donald L. / Stinson, Douglas R., |
|---|---|
| シリーズ | Discrete Mathematics and Its Applications |
| 出版社 | (CRC Press Inc, US) |
| 出版年月 | 1998 |
| ページ数 | 342 pp. |
| 言語 | ENG |
| ニュース番号 | ＜M25-11228 M25-4474＞ |
解説
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:
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.