Combinatorics for Computer Science (Dover Books on Mathematics)

By S. Gill Williamson

Book Overview

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. References for Linear Order & for Graphs, Trees, and Recursions. 219 figures. This description may be from another edition of this product.

• Format: Hardcover
• Language: English
• ISBN: 0881750204
• ISBN13: 9780881750201
• Release Date: January 1985
• Publisher: Computer Science Press
• Length: 479 Pages
• Weight: 2.00 lbs.

Customer Reviews

Suitable for a graduate level course

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...

Excellent reference for data structure algorithm complexity.

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.