
Ebook Info
- Published: 1998
- Number of pages: 344 pages
- Format: PDF
- File Size: 13.33 MB
- Authors: Donald L. Kreher
Description
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.
User’s Reviews
Editorial Reviews: 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 Kreher, Donald L.; Stinson, Douglas R.
Reviews from Amazon users which were colected at the time this book was published on the website:
⭐was a gift exactly what he wanted
⭐The title claims more than the contents. The contents’ usefulness is questionable. Who would want to pay this high price and for what purpose?
⭐
Keywords
Free Download Combinatorial Algorithms: Generation, Enumeration, and Search (Discrete Mathematics and Its Applications) 1st Edition in PDF format
Combinatorial Algorithms: Generation, Enumeration, and Search (Discrete Mathematics and Its Applications) 1st Edition PDF Free Download
Download Combinatorial Algorithms: Generation, Enumeration, and Search (Discrete Mathematics and Its Applications) 1st Edition 1998 PDF Free
Combinatorial Algorithms: Generation, Enumeration, and Search (Discrete Mathematics and Its Applications) 1st Edition 1998 PDF Free Download
Download Combinatorial Algorithms: Generation, Enumeration, and Search (Discrete Mathematics and Its Applications) 1st Edition PDF
Free Download Ebook Combinatorial Algorithms: Generation, Enumeration, and Search (Discrete Mathematics and Its Applications) 1st Edition