ePrivacy and GPDR Cookie Consent by Cookie Consent

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.

Exciting news! I've found some fantastic books for you! πŸ“šβœ¨ Check below to see your tailored recommendations. Happy reading! πŸ“–πŸ˜Š

Combinatorial Algorithms

Generation, Enumeration, and Search

Donald L. Kreher , Douglas R. Stinson

Computers / Programming / Algorithms

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.
  • Do you want to read this book? 😳
    Buy it now!

    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.