Combinatorial Algorithms
generation, enumeration, and search
$248.46
- Paperback
344 pages
- Release Date
1 November 2019
Summary
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:
Book Details
| ISBN-13: | 9780367400156 |
|---|---|
| ISBN-10: | 0367400154 |
| Author: | Donald L. Kreher, Douglas R. Stinson |
| Publisher: | Taylor & Francis Ltd |
| Imprint: | CRC Press |
| Format: | Paperback |
| Number of Pages: | 344 |
| Release Date: | 1 November 2019 |
| Weight: | 535g |
| Dimensions: | 234mm x 156mm |
| Series: | Discrete Mathematics and Its Applications |
What They're Saying
Critics Review
“Very clear exposition. I jumped right into [the] heuristic methods chapter and understood it almost instantly…”- Dean H. Judson, Ph.D., Nevada State Demographer”…book serves as an introduction to the basic problems and methods…style is clear, transparent…The algorithmic problems are always considered and they are in the center of the discussion…has a fresh approach to combinatorics that is available for readers, students in computer science, electrical engineering without any background in mathematics.“- Péter Hajnal, Acta Science Math
About The Author
Donald L. Kreher
Kreher, Donald L.; Stinson, Douglas R.
Returns
This item is eligible for free returns within 30 days of delivery. See our returns policy for further details.