skip to content
The Stanford GraphBase : a platform for combinatorial computing Preview this item
ClosePreview this item
Checking...

The Stanford GraphBase : a platform for combinatorial computing

Author: Donald Ervin Knuth
Publisher: New York, N.Y. : ACM Press ; Reading, Mass. : Addison-Wesley, ©1993.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
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  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Additional Physical Format: Online version:
Knuth, Donald Ervin, 1938-
Stanford GraphBase.
New York, N.Y. : ACM Press ; Reading, Mass. : Addison-Wesley, c1993
(OCoLC)606813954
Document Type: Book
All Authors / Contributors: Donald Ervin Knuth
ISBN: 0201542757 9780201542752
OCLC Number: 28017985
Description: vii, 576 p. : ill. ; 24 cm.
Contents: Technicalities --
Installation and use --
How to read CWEB programs --
Programs of the Stanford GraphBase --
Appendix A. Error codes --
Appendix B. Summary of function calls --
Appendix C. Example graph parameters --
Appendix D. 3000 five-letter words.
Responsibility: Donald E. Knuth.
More information:

Abstract:

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.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/28017985>
library:oclcnum"28017985"
library:placeOfPublication
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/28017985>
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:copyrightYear"1993"
schema:creator
schema:datePublished"1993"
schema:description"Technicalities -- Installation and use -- How to read CWEB programs -- Programs of the Stanford GraphBase -- Appendix A. Error codes -- Appendix B. Summary of function calls -- Appendix C. Example graph parameters -- Appendix D. 3000 five-letter words."@en
schema:description"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."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/866515845>
schema:inLanguage"en"
schema:name"The Stanford GraphBase : a platform for combinatorial computing"@en
schema:numberOfPages"576"
schema:publisher
schema:publisher
schema:url
schema:workExample

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.