Combinatorial Algorithms (Paperback)
Language: English
Published by Taylor & Francis Ltd, London, 2019
Series: Book 58 of 67 - Discrete Mathematics and Its Applications
- Softcover
- New

Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.Grand Eagle Retail
AbeBooks seller since October 12, 2005
Condition: New
US$ 120.77
Quantity: 1 available
Add to basketItem description from seller
Paperback. 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. Combinatorial Algorithms: Generation, Enumeration, and Search thoroughly outlines and analyzes combinatorial algorithms for generation, enumeration, and search applications. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…
Seller Inventory # 9780367400156
- Title
- Combinatorial Algorithms (Paperback)
- Author
- Donald L. Kreher
- Publisher
- Taylor & Francis Ltd, London
- Publication year
- 2019
- Condition
- new
- Binding
- Paperback
- Language
- English
- ISBN 10
- 0367400154
- ISBN 13
- 9780367400156
- Series
- Book 58 of 67: Discrete Mathematics and Its Applications
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.
"Synopsis" may belong to another edition of this title.
About the Author
"About the title" may belong to another edition of this title.
Grand Eagle Retail
Bensenville, IL, U.S.A.
AbeBooks seller since October 12, 2005
Shipping rates within U.S.A.
| Item | 6 to 14 business days | 6 to 16 business days |
|---|---|---|
| First item | US$ 0.00 | US$ 0.00 |
Payment methods
Seller's business information
APOLLO ONLINE CORP.
605 Geddes Street
Wilmington, DE U.S.A. 19805
Terms of sale
We guarantee the condition of every book as it¿s described on the Abebooks web sites. If you¿ve changed
your mind about a book that you¿ve ordered, please use the Ask bookseller a question link to contact us
and we¿ll respond within 2 business days.
Books ship from California and Michigan.
Shipping terms
Orders usually ship within 2 business days. All books within the US ship free of charge. Delivery is 4-14 business days anywhere in the United States.
Books ship from California and Michigan.
If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.