Suggestion: See the list of our categories.

Books - Subjects Books - Computers & Technology Books - Operating Systems Books - Programming Books - Algorithms Books - Science & Math Books - Mathematics Books - Pure Mathematics Books - Algebra Books - Combinatorics Books - Discrete Mathematics Books - Number Theory Books - Books Books - Specialty Boutique Books - New, Used & Rental Textbooks Books - Computer Science Books - Operating Systems Books - Science & Mathematics Books - Mathematics Books - Algebra & Trigonometry BSD Linux Macintosh Solaris Unix Windows

Combinatorial Algorithms: Generation, Enumeration, and Search (Discrete Mathematics and Its Applications)

Combinatorial Algorithms: Generation, Enumeration, and Search (Discrete Mathematics and Its Applications) - /images-na.ssl-images-com/images/I/31NpiYNlXdL.jpgSpacerCombinatorial Algorithms: Generation, Enumeration, and Search (Discrete Mathematics and Its Applications) - /images-na.ssl-images-com/images/I/51Ktjd8El5L.jpgSpacer

Move the mouse over each image or photo to enlarge ...
Brand : CRC Press - ASIN : 084933988x - EAN : 9780849339882
Amazon

My orders

Retail price from :   $140.00  $106.61    Prices may vary.
    Amount saved : $33.39   -24%  

Warranty :   

Quantity available :   New : 21    Used : 15        Usually ships in 24 hours

Description

  • Used Book in Good Condition
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.