- Hardcover: 592 pages
- Publisher: Addison Wesley; 1 edition (30 Nov 1993)
- Language English
- ISBN-10: 0201542757
- ISBN-13: 978-0201542752
- Product Dimensions: 24.2 x 19.8 x 3.5 cm
-
Amazon Bestsellers Rank:
3,225,925 in Books (See Top 100 in Books)
- #20 in Books > Computers & Internet > Computer Science > Algorithms > Combinatorial Algorithms
- See Complete Table of Contents
| |||||||||||||||
Did you know you can trade in your old books for an Amazon.co.uk Gift Card to spend on the things you want? Plus, get an extra £5 Gift Certificate when you trade in books worth £10 or more before June 30, 2012. Visit the Books Trade-In Store for more details. |
Product details |
More About the Author
Product Description
Product Description
The Stanford GraphBase: A Platform for Combinatorial Computing represents the first efforts of Donald E. Knuth's preparation for Volume Four of The Art of Computer Programming. The book's first goal is to use examples to demonstrate the art of literate programming. Each example provides a programmatic essay that can be read and enjoyed as readily as it can be interpreted by machines. In these essays/programs, Knuth makes new contributions to several important algorithms and data structures, so the programs are of special interest for their content as well as for their style. The book's second goal is to provide a useful means for comparing combinatorial algorithms and for evaluating methods of combinatorial computing. To this end, Knuth's programs offer standard, freely available sets of data - the Stanford GraphBase - that may be used as benchmarks to test competing methods. The data sets are both interesting in themselves and applicable to a wide variety of problem domains. With objective tests, Knuth hopes to bridge the gap between theoretical computer scientists and programmers who have real problems to solve.As with all of Knuth's writings, this book is appreciated not only for the author's unmatched insight, but also for the fun and the challenge of his work. He illustrates many of the most significant and most beautiful combinatorial algorithms that are presently known and provides sample programs that can lead to hours of amusement. In showing how the Stanford GraphBase can generate an almost inexhaustible supply of challenging problems, some of which may lead to the discovery of new and improved algorithms, Knuth proposes friendly competitions. His own initial entries into such competitions are included in the book, and readers are challenged to do better. Features *Includes new contributions to our understanding of important algorithms and data structures *Provides a standard tool for evaluating combinatorial algorithms *Demonstrates a more readable, more practical style of programming *Challenges readers to surpass his own efficient algorithms 0201542757B04062001
From the Back Cover
The Stanford GraphBase: A Platform for Combinatorial Computing represents the first efforts of Donald E. Knuth's preparation for Volume Four of The Art of Computer Programming. The book's first goal is to use examples to demonstrate the art of literate programming. Each example provides a programmatic essay that can be read and enjoyed as readily as it can be interpreted by machines. In these essays/programs, Knuth makes new contributions to several important algorithms and data structures, so the programs are of special interest for their content as well as for their style.
The book's second goal is to provide a useful means for comparing combinatorial algorithms and for evaluating methods of combinatorial computing. To this end, Knuth's programs offer standard, freely available sets of data - the Stanford GraphBase - that may be used as benchmarks to test competing methods. The data sets are both interesting in themselves and applicable to a wide variety of problem domains. With objective tests, Knuth hopes to bridge the gap between theoretical computer scientists and programmers who have real problems to solve.
As with all of Knuth's writings, this book is appreciated not only for the author's unmatched insight, but also for the fun and the challenge of his work. He illustrates many of the most significant and most beautiful combinatorial algorithms that are presently known and provides sample programs that can lead to hours of amusement. In showing how the Stanford GraphBase can generate an almost inexhaustible supply of challenging problems, some of which may lead to the discovery of new and improved algorithms, Knuth proposes friendly competitions. His own initial entries into such competitions are included in the book, and readers are challenged to do better.
Features
- Includes new contributions to our understanding of important algorithms and data structures
- Provides a standard tool for evaluating combinatorial algorithms
- Demonstrates a more readable, more practical style of programming
- Challenges readers to surpass his own efficient algorithms
0201542757B04062001
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organise and find favourite items. |
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Reviews
There are no customer reviews yet on Amazon.co.uk.
5 star
4 star
3 star
2 star
1 star
Most Helpful Customer Reviews on Amazon.com (beta)
Amazon.com:
2 reviews
1 of 2 people found the following review helpful
Part of the Computer Science canon
14 Dec 2009
Format:Hardcover|Amazon Verified Purchase
This is a stellar book. It's important, clear, and fun to read. Donald Knuth at his best.
4 of 30 people found the following review helpful
Knuth's eccentricity discourages beginners
23 Mar 2002
Format:Hardcover
I found that Knuth's reputation for eccenctricity gets in the way of actually getting to the meat of the book. For example, getting the programs to compile under Windows was not as straightforward as it could be (although not that difficult). Much harder was to get used to the idea of using CTANGLE and CWEB in order to get Graphbase to a state where you can actually compile it.
It does not help at all that Chapter 3 of the book is when how to install Graphbase is actually discussed. Just for these alone I have to give the book a 3 star rating. Perhaps I will change this once I have had the opportunity peruse the _real_ contents of the book.
Were these reviews helpful?
Let us know
Listmania!
Look for similar items by category
- Books > Computing & Internet > Programming > Algorithms > Combinatorial Algorithms
- Books > Computing & Internet > Programming > Graphics & Multimedia
- Books > Computing & Internet > Software & Graphics
- Books > Science & Nature > Mathematics > Combinatorics & Graph Theory
- Books > Science & Nature > Mathematics > Education > Higher Education
- Books > Science & Nature > Popular Science > Maths
- Books > Scientific, Technical & Medical > Mathematics > Combinatorics & Graph Theory
Look for similar items by subject
Feedback
- Would you like to update product info or give feedback on images?
- I am the Author, and I want to comment on my book.
- I am the Publisher, and I want to comment on this book.
