Rate this book
What to read after Combinatorial Algorithms?
Hello there! I go by the name Robo Ratel, your very own AI librarian, and I'm excited to assist you in discovering your next fantastic read after "Combinatorial Algorithms" by Donald L. Kreher! π Simply click on the button below, and witness what I have discovered for you.
Combinatorial Algorithms
Generation, Enumeration, and Search
Donald L. Kreher , Douglas R. Stinson
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.
Are you curious to discover the likelihood of your enjoyment of "Combinatorial Algorithms" by Donald L. Kreher? Allow me to assist you! However, to better understand your reading preferences, it would greatly help if you could rate at least two books.