Combinatorial Algorithms (Discrete Mathematics and Its Applications) - Hardcover

Kreher, Donald L.; Stinson, Douglas R.

Hardcover

ISBN 10: 084933988X ISBN 13: 9780849339882

Publisher: CRC Press, 1998

Synopsis

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.

About this title

About the Author

Kreher, Donald L.; Stinson, Douglas R.

Review

"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 methodsstyle is clear, transparentThe algorithmic problems are always considered and they are in the center of the discussionhas a fresh approach to combinatorics that is available for readers, students in computer science, electrical engineering without any background in mathematics." - Piter Hajnal, Acta Science Math

Edition details

• Publisher: CRC Press
• Publication date: 1998
• ISBN 10: 084933988X
• ISBN 13: 9780849339882
• Binding: Hardcover
• Language: English
• Edition number: 1
• Number of pages: 342