Combinatorics for Computer Science (Dover Books on Mathematics) (Paperback)

by S. Gill Williamson (Author)

Editorial Reviews

Product Description
Useful guide covers two major subdivisions of combinatorics--enumeration and graph theory--with emphasis on conceptual needs of computer science. Each part is divided into a "basic concepts" chapter emphasizing intuitive needs of the subject, followed by four "topics" chapters that explore these ideas in depth. Invaluable practical resource for graduate students, advanced undergraduates, and professionals with an interest in algorithm design and other aspects of computer science and combinatorics. Unabridged republication of original 1985 edition. References for Linear Order & for Graphs, Trees, and Recursions. 219 figures.

Product Details

• Paperback: 523 pages
• Publisher: Dover Publications (May 8, 2002)
• Language: English
• ISBN-10: 0486420760
• ISBN-13: 978-0486420769
• Product Dimensions: 8.3 x 5.5 x 1.1 inches
• Shipping Weight: 1.2 pounds (View shipping rates and policies)
• Average Customer Review: 4.5 out of 5 stars See all reviews (2 customer reviews)
• Amazon.com Sales Rank: #758,439 in Books (See Bestsellers in Books)

Customer Reviews

Most Helpful Customer Reviews

6 of 6 people found the following review helpful:

4.0 out of 5 stars Suitable for a graduate level course, June 25, 2005

By	Charles Ashbacher "([e-mail])" (Marion, Iowa United States([e-mail])) - See all my reviews (TOP 50 REVIEWER)

While most computer science departments require their students to take calculus, with few exceptions it is a skill that they will not use. The mathematics used by computer scientists is almost exclusively discrete in nature. In fact, assumptions concerning continuity can often lead to subtle errors in programming, the laws of algebra do not universally apply in computing. This book presents most of the key ideas of discrete mathematics applied to computing and the coverage is thorough and detailed.
It is split into two parts, linear order and graphs, trees and recursion. The emphasis is on detailed problem solving rather than explanations of the foundations. For example, there is a detailed example of a lexicographic bucket sort on page 16. The material is presented using higher level mathematical notation, so it is best suited for graduate level courses. A large number of exercises are included, but no solutions are given.
If you are looking for a text to be used in classes that have significant discrete mathematics prerequisites, then this book is certainly appropriate. It would be best suited for students with a great deal of programming experience.

4 of 10 people found the following review helpful:

5.0 out of 5 stars Excellent reference for data structure algorithm complexity., March 26, 2001

By	Bruce G Greenblatt "Bruce G" (San Jose, CA United States) - See all my reviews

This review is from: Combinatorics for computer science (Computers and math series) (Hardcover)

This excellent reference has numerous examples, definitions and exercises covering trees, graphs, linked lists etc. This book provides a great companion to any data structures text.