Donald L. Kreher; Douglas R. Stinson· ISBN 9781000141375
Special offer terms
Zookal Study Premium
Subscribe & save
By selecting the 'Susbcribe & Save' option you are enrolling in an auto-renewing subscription of Zookal Study Premium. Cancel at anytime.
Auto-Renewal
Your Zookal Study Premium subscription will be renewed each month until you cancel. You consent to Zookal automatically charging your payment method on file $19.99 each month after 1st month free period until you cancel.
How to Cancel
You can cancel your subscription anytime by visiting Manage account page, clicking "Manage subscription" and completing the steps to cancel. Cancellations take effect at the end of the 1st month free period (if applicable) or at the end of the current billing cycle in which your request to cancel was received. Subscription fees are not refundable.
Zookal Study Premium Monthly Subscription Includes:
Ability to post up to ten (10) questions per month.
20% off your textbooks order and free standard shipping whenever you shop online at
textbooks.zookal.com.au
Unused monthly subscription benefits have no cash value, are not transferable, and expire at the end of each month. This means that subscription benefits do not roll over to or accumulate for use in subsequent months.
Payment Methods
Afterpay and Zip Pay will not be available for purchases with Zookal Study Premium subscription added to bag.
$1.00 preauthorisation
You may see a $1.00 preauthorisation by your bank which will disappear from your statement in a few business days..
Email communications
By adding Zookal Study Premium, you agree to receive email communications from Zookal.
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.