Combinatorics for Computer Science (Dover Books on Mathematics)

Rating:
Summary: Good content, with Dover's usual pathetic editing.
Review: I have purchased a dozen Dover math books over the years and have always been disappointed by the poor or non-existent editing. I guess Dover sees it's role as a low-budget provider of math information for those who won't spend $100 or so on the latest textbook. The consequence is always unusual pain and suffering for the reader.

The following sentence, from the first page of chapter 1 illustrates the problem: "The notion of a relation is, of course, a triviality in full generality". Even a rookie editor should have known to strike that white elephant.

The text is copyright 1985. Gill Williamson knew his stuff. Dover sucks. It's 5 stars for Williamson, 1 for Dover, which by Amazonian mathematics yields 3 stars for the book.


Rating:
Summary: Excellent reference for data structure algorithm complexity.
Review: 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.

Rating:
Summary: Excellent reference for data structure algorithm complexity.
Review: 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.