Title
The Stanford GraphBase: A Platform for Combinatorial Computing,Used
Sold by Ergodebooks, an authorized reseller.
Returns accepted within 30 days | support@ergodebooks.com
Shipping Information
- Free Standard Shipping — United States only
- Processing Time: 1–3 business days
- Estimated Delivery: 3–5 business days after dispatch
- Double-boxed, fully insured & discreetly packaged
- Tracking number sent via email once dispatched
- Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund
Returns accepted within 30 days of delivery.
Damaged or Defective Item
Free return shipping + replacement or full refund
Wrong Item Received
Free return shipping + replacement or full refund
Change of Mind
Return shipping at customer's expense · 25% restocking fee applies
Payment Option
The Stanford GraphBase: A Platform for Combinatorial Computing represents the first fruits of Donald E. Knuth's preparation for Volume 4 of The Art of Computer Programming. The book's first goal is to demonstrate, through about 30 examples, the art of literate programming. Each example is a programmatic essay, a short story that can be read and enjoyed by human beings as readily as it can be read and interpreted by machines. In these essays/programs, Knuth makes new contributions to the exposition of 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 here made possible, 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, in which he invites us to participate. He illustrates many of the most significant and most beautiful combinatorial algorithms that are presently known and provides demonstration programs that can lead to hours of amusement. In showing how the Stanford GraphBase can generate an almost exhaustible 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.
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.
For more information, please visit www.P65Warnings.ca.gov.
- Q: What is 'The Stanford GraphBase' about? A: 'The Stanford GraphBase' is a book by Donald E. Knuth that showcases the art of literate programming through approximately 30 programmatic essays. It aims to provide insights into combinatorial algorithms and offers a platform for evaluating methods of combinatorial computing.
- Q: Who is the author of this book? A: The book is authored by Donald E. Knuth, a renowned computer scientist known for his contributions to algorithms and programming.
- Q: What are the main goals of 'The Stanford GraphBase'? A: The primary goals are to illustrate the art of literate programming and to offer a benchmark for comparing combinatorial algorithms using the Stanford GraphBase data sets.
- Q: What type of content can I expect in the book? A: The book contains programmatic essays that are both informative and engaging, showcasing significant combinatorial algorithms and offering demonstration programs.
- Q: How many pages are in 'The Stanford GraphBase'? A: 'The Stanford GraphBase' consists of 592 pages, providing ample material for readers interested in combinatorial computing.
- Q: Is this book suitable for beginners in programming? A: While the book is accessible, it is best suited for readers with a foundational understanding of programming concepts, as it delves into complex algorithms.
- Q: What is the binding of the book? A: 'The Stanford GraphBase' is available in hardcover binding, which adds to its durability and makes it suitable for repeated use.
- Q: When was 'The Stanford GraphBase' published? A: The book was published on November 30, 1993.
- Q: What is the item condition of the book? A: The book is listed as being in 'Good' condition, which typically indicates that it is used but well-maintained.
- Q: Can the algorithms in the book be applied to real-world problems? A: Yes, the algorithms and data sets presented in the book are applicable to a variety of problem domains, making them relevant for practical computing challenges.