Limit this search to....

Combinatorial Algorithms: Generation, Enumeration, and Search
Contributor(s): Kreher, Donald L. (Author), Stinson, Douglas R. (Author)
ISBN: 084933988X     ISBN-13: 9780849339882
Publisher: CRC Press
OUR PRICE:   $161.50  
Product Type: Hardcover - Other Formats
Published: December 1998
Qty:
Annotation:

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.

Additional Information
BISAC Categories:
- Mathematics | Combinatorics
- Mathematics | Discrete Mathematics
- Mathematics | Number Theory
Dewey: 511.6
LCCN: 98041243
Series: Discrete Mathematics and Its Applications
Physical Information: 0.93" H x 6.4" W x 9.51" (1.44 lbs) 342 pages
 
Descriptions, Reviews, Etc.
Publisher 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:

  • 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.