Jump to content

Featured Replies

Posted
Combinatorial Algorithms

Combinatorial Algorithms

Generation, Enumeration, and Search

by Donald L. Kreher, Douglas R. Stinson

Publisher CRC Press
Published Date 1998-12-18
Page Count 344
Categories Mathematics / Combinatorics, Mathematics / Number Theory, Computers / Operating Systems / General, Mathematics / Discrete Mathematics
Language EN
Average Rating N/A (based on N/A ratings)
Maturity Rating No Mature Content Detected
ISBN 084933988X
Book Cover 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.
  • More Information

    Create an account or sign in to comment

    Important Information

    Terms of Use Privacy Policy Guidelines We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.