Home > Store

larger cover

Add To My Wish List

Stanford GraphBase: A Platform for Combinatorial Computing, The

Register your product to gain access to bonus material or receive a coupon.

  • Description
  • Reviews

Product Author Bios

Donald E. Knuth is known throughout the world for his pioneering work on algorithms and programming techniques, for his invention of the Tex and Metafont systems for computer typesetting, and for his prolific and influential writing. Professor Emeritus of The Art of Computer Programming at Stanford University, he currently devotes full time to the completion of these fascicles and the seven volumes to which they belong.

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

Customer Reviews

1 of 2 people found the following review helpful
5.0 out of 5 stars Part of the Computer Science canon, December 13, 2009
By 
Kurt D. Starsinic (Brooklyn, NY United States) - See all my reviews
(REAL NAME)   
Amazon Verified Purchase(What's this?)
This is a stellar book. It's important, clear, and fun to read. Donald Knuth at his best.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


4 of 32 people found the following review helpful
3.0 out of 5 stars Knuth's eccentricity discourages beginners, March 23, 2002
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.

Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


Share your thoughts with other customers:
 See both customer reviews...
 
Buy

Book  $74.99  $59.99

Usually ships in 24 hours.

This book includes free shipping!

Purchase Reward: One Month Free Subscription
By completing any purchase on InformIT, you become eligible for an unlimited access one-month subscription to Safari Books Online.

Get access to thousands of books and training videos about technology, professional development and digital media from more than 40 leading publishers, including Addison-Wesley, Prentice Hall, Cisco Press, IBM Press, O'Reilly Media, Wrox, Apress, and many more. If you continue your subscription after your 30-day trial, you can receive 30% off a monthly subscription to the Safari Library for up to 12 months. That's a total savings of $199.