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:
Many classical areas are covered as well as new research topics not included in most existing texts, such as:
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.
Combinatorial Algorithms: Generation, Enumeration, and Search
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 textbook thoroughly outlines combinatorial algorithms for generation, enumeration, and search. Topics include backtracking and heuristic search methods applied to various combinatorial structures, such as:
Many classical areas are covered as well as new research topics not included in most existing texts, such as:
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.
62.49
In Stock
5
1
Combinatorial Algorithms: Generation, Enumeration, and Search
344Combinatorial Algorithms: Generation, Enumeration, and Search
344eBook
$62.49
$82.99
Save 25%
Current price is $62.49, Original price is $82.99. You Save 25%.
Related collections and offers
62.49
In Stock
Product Details
ISBN-13: | 9781000141375 |
---|---|
Publisher: | CRC Press |
Publication date: | 09/23/2020 |
Series: | Discrete Mathematics and Its Applications |
Sold by: | Barnes & Noble |
Format: | eBook |
Pages: | 344 |
File size: | 33 MB |
Note: | This product may take a few minutes to download. |
About the Author
From the B&N Reads Blog