The Stanford GraphBase

The Stanford GraphBase A Platform for Combinatorial Computing

Hardback (30 Nov 1993)

Not available for sale

Includes delivery to the United States

Out of stock

This service is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Publisher's Synopsis

This book 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 humans as readily as it can be read and interpreted by machines. In these essay/progrcms, Knuth makes new contributions to the expositions of several important algorithms and dcta structures, so the programs are of special interest for their content as well as for their style. Tue book's second goal is to provide a concise means for comparing combinatorial algorithms cnd for evaluating methods of combinatorial computing. To this end, Knuth's programs offer standard, freely available sets of dctc - the Standford GraphBose that may be used cs benchmarks to test competing methods.

Book information

ISBN: 9780201542752
Publisher: Pearson Education
Imprint: Addison-Wesley
Pub date:
DEWEY: 511.5028553
DEWEY edition: 20
Language: English
Number of pages: 576
Weight: 1176g
Height: 245mm
Width: 200mm
Spine width: 34mm