Description
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.
About the Author
Kreher, Donald L.; Stinson, Douglas R.
Reviews
"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 is available for readers, students in computer science, electrical engineering without any background in mathematics."
- Peter Hajnal, Acta Science Math
Book Information
ISBN 9780849339882
Author Donald L. Kreher
Format Hardback
Page Count 342
Imprint CRC Press Inc
Publisher Taylor & Francis Inc
Weight(grams) 660g
