menu
{ "item_title" : "Combinatorial Algorithms", "item_author" : [" Donald L. Kreher", "Douglas R. Stinson "], "item_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:CombinationsPermutationsGraphsDesignsMany classical areas are covered as well as new research topics not included in most existing texts, such as:Group algorithmsGraph isomorphismHill-climbingHeuristic search algorithmsThis 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.", "item_img_path" : "https://covers3.booksamillion.com/covers/bam/0/84/933/988/084933988X_b.jpg", "price_data" : { "retail_price" : "189.99", "online_price" : "189.99", "our_price" : "189.99", "club_price" : "189.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Combinatorial Algorithms|Donald L. Kreher

Combinatorial Algorithms : Generation, Enumeration, and Search

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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.

This item is Non-Returnable

Details

  • ISBN-13: 9780849339882
  • ISBN-10: 084933988X
  • Publisher: CRC Press
  • Publish Date: December 1998
  • Dimensions: 9.51 x 6.4 x 0.93 inches
  • Shipping Weight: 1.44 pounds
  • Page Count: 342

Related Categories

You May Also Like...

    1

BAM Customer Reviews