Stock image for illustration purposes only - book cover, edition or condition may vary.
Combinatorial Algorithms: Generation, Enumeration, and Search
Donald L. Kreher
€ 151.02
FREE Delivery in Ireland
Description for Combinatorial Algorithms: Generation, Enumeration, and Search
Hardback. Outlines and analyzes combinatorial algorithms for generation, enumeration and search applications. This work introduces the important combinatorial algorithmic techniques. It covers group algorithms, graph isomorphisms, hill-climbing and heuristic search algorithms. Series: Discrete Mathematics and its Applications. Num Pages: 344 pages, 8 black & white tables. BIC Classification: PBV; PBW. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 235 x 156 x 20. Weight in Grams: 660.
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 ... Read more Show Less
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 ... Read more
Product Details
Format
Hardback
Publication date
1998
Publisher
Taylor & Francis Inc United States
Number of pages
344
Condition
New
Series
Discrete Mathematics and its Applications
Signed by the author
;Yes
Number of Pages
342
Place of Publication
Bosa Roca, United States
ISBN
9780849339882
SKU
V9780849339882
Shipping Time
Usually ships in 4 to 8 working days
Ref
99-1
About Donald L. Kreher
Kreher, Donald L.; Stinson, Douglas R.
Reviews for Combinatorial Algorithms: Generation, Enumeration, and Search
"Very clear exposition. I jumped right into [the] heuristic methods chapter and understood it almost instantly..." - Dean H. Judson, Ph.D., Nevada State Demographer "…book serves as an introduction to the basic problems and methods…style is clear, transparent…The algorithmic problems are always considered and they are in the center of the discussion…has a fresh approach to combinatorics that ... Read more