Combinatorial Algorithms : Generation, Enumeration, and Search
Book Details
Format
Paperback / Softback
Book Series
Discrete Mathematics and Its Applications
ISBN-10
0367400154
ISBN-13
9780367400156
Publisher
Taylor & Francis Ltd
Imprint
CRC Press
Country of Manufacture
GB
Country of Publication
GB
Publication Date
Nov 1st, 2019
Print length
344 Pages
Weight
544 grams
Dimensions
15.50 x 23.40 x 2.30 cms
Product Classification:
Discrete mathematicsNumber theoryCombinatorics & graph theory
Ksh 12,600.00
Werezi Extended Catalogue
Delivery in 14 days
Delivery Location
Delivery fee: Select location
Delivery in 14 days
Secure
Quality
Fast
Combinatorial Algorithms: Generation, Enumeration, and Search thoroughly outlines and analyzes combinatorial algorithms for generation, enumeration, and search applications.
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.
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.
Get Combinatorial Algorithms by at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by Taylor & Francis Ltd and it has pages.
