Combinatorial Algorithms - Generation, Enumeration, and Search (Hardcover)

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.

General

Imprint:	Crc Press
Country of origin:	United States
Series:	Discrete Mathematics and Its Applications
Release date:	December 1998
First published:	1999
Authors:	Donald L. Kreher • Douglas R. Stinson
Dimensions:	234 x 156 x 22mm (L x W x T)
Format:	Hardcover
Pages:	344
ISBN-13:	978-0-8493-3988-2
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Books > Science & Mathematics > Mathematics > Applied mathematics > General
LSN:	0-8493-3988-X
Barcode:	9780849339882

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!