Combinatorial Algorithms : Generation, Enumeration, and Search
Book Details
Format
Hardback
Book Series
Discrete Mathematics and Its Applications
ISBN-10
084933988X
ISBN-13
9780849339882
Publisher
Taylor & Francis Inc
Imprint
CRC Press Inc
Country of Manufacture
GB
Country of Publication
GB
Publication Date
Dec 18th, 1998
Print length
342 Pages
Weight
688 grams
Dimensions
16.60 x 24.20 x 2.20 cms
Product Classification:
Combinatorics & graph theoryCombinatorics and graph theoryApplied mathematics
KSh 26,300.00
Currently unavailable
0 in stock
Delivery Location
Delivery fee: Select location
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 Donald L. Kreher, Douglas R. Stinson at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by Taylor & Francis Inc and it has 342 pages.
Customers Who Bought This Also Bought
Principia Mathematica - Volume One
KSh 6,700.00
The Random Number Code
KSh 36,000.00
Octonion Sparse-Based Image Processing
KSh 26,200.00
Algebra and Discrete Mathematics for Economics
KSh 13,150.00
Counting: Solutions Manual (2nd Edition)
KSh 6,300.00
Combinatorics on Words
KSh 17,650.00
Discrete Geometry and Algebraic Combinatorics
KSh 20,000.00
Combinatorial Geometry and Its Algorithmic Applications
KSh 19,800.00
Modern Trends in Fuzzy Graph Theory
KSh 8,100.00
Well-Quasi Orders in Computation, Logic, Language and Reasoning
KSh 28,800.00
Fuzzy Graph Theory with Applications to Human Trafficking
KSh 21,600.00
A Tribute to Paul Erdos
KSh 26,450.00
More by Donald L. Kreher, Douglas R. Stinson
A Primer on Post-Quantum Cryptography
KSh 11,350.00
A Primer on Post-Quantum Cryptography
KSh 30,950.00
Graphs, Algorithms, and Optimization
KSh 15,850.00
Techniques for Designing and Analyzing Algorithms
KSh 17,300.00
Combinatorial Algorithms
KSh 13,150.00
Graphs, Algorithms, and Optimization
KSh 9,550.00
Techniques for Designing and Analyzing Algorithms
KSh 11,300.00
