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

S. Gill Williamson (Author)

Book Description

Publication Date: May 8, 2002 | Series: Dover Books on Mathematics

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. Includes 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.5 x 5.4 x 1 inches
• Shipping Weight: 1.2 pounds
• Average Customer Review: 4.7 out of 5 stars  See all reviews (3 customer reviews)
• Amazon Best Sellers Rank: #977,702 in Books (See Top 100 in Books)

Customer Reviews

Most Helpful Customer Reviews

10 of 11 people found the following review helpful:

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

By 

Charles Ashbacher (Marion, Iowa United States) - See all my reviews
(TOP 500 REVIEWER)    (VINE VOICE)    (HALL OF FAME REVIEWER)   

This review is from: Combinatorics for Computer Science (Dover Books on Mathematics) (Paperback)

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.

5.0 out of 5 stars good textbook, outstanding guide for programmers, February 19, 2012

By 

Marc Mest - See all my reviews
(REAL NAME)   

Amazon Verified Purchase

This review is from: Combinatorics for Computer Science (Dover Books on Mathematics) (Paperback)

I am a software engineer by trade, and this is the book I wish I had with me.

Today, I don't see it as a textbook for coursework, but I think there are probably better in today's world. Though I will let the other reviewer's viewpoint on this address that issue.

However, this is an excellent book for any programmer or software engineer. Honestly I doubt most programmers have this math background ( okay contradicting myself a little, but I did say the other reviewer covered the academic side of this ).

The structure of this books makes it an excellent self-study or reference for actually coding. You will have to brush up on the notation at the beginning of the book, but that is minor.

It is well written and has very broad coverage of the subject and does not lose rigor or examples. It is well illustrated when it needs to be. Whether you are writing sorting routines or want to really understand and implement graph theory. ( the graph theory coverage is outstanding. ). Honestly you could spend a month learning everything you wanted to know about sorting and network optization from this book.

It is not an easy textbook, and honestly I have alot to learn from it yet, but I just simply have to revisit some of my math foundations. But even if you get lost on part of the material in the book, it is still worth it for what you will get.

The only cons are some of the material not covered in this book from number theory, which newer textbooks really cover well.

4 of 11 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.