Stanford Graphbase, The: A Platform For Combinatorial Computing Pdf
Reading, MA.: Addison Wesley, 1993. Comprehensive highly acclaimed text utilizes 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. Knuth illust.Bookseller:,Colorado, United States.
The Stanford GraphBase. The fully documented source code is available for anonymous ftp from Stanford University and in the book “The Stanford GraphBase, A Platform for Combinatorial Computing,” published jointly by ACM Press and Addison-Wesley Publishing Company in 1993. (This book contains several chapters with additional information not available.
The Stanford Graphbase A Platform For Combinatorial Computing Pdf
- 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.
- Includes bibliographical references (p. 568-569) and indexes. EMBED (for wordpress.com hosted blogs and archive.org item tags).