Stanford GraphBase, The: A Platform for Combinatorial Computing

Author:   Donald Knuth
Publisher:   Pearson Education Limited
ISBN:  

9780201542752


Pages:   592
Publication Date:   30 November 1993
Format:   Hardback
Availability:   Awaiting stock   Availability explained


Our Price $171.57 Quantity:  
Add to Cart

Share |

Stanford GraphBase, The: A Platform for Combinatorial Computing


Add your own review!

Overview

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.

Full Product Details

Author:   Donald Knuth
Publisher:   Pearson Education Limited
Imprint:   Addison Wesley
Dimensions:   Width: 24.50cm , Height: 3.40cm , Length: 24.20cm
Weight:   1.176kg
ISBN:  

9780201542752


ISBN 10:   0201542757
Pages:   592
Publication Date:   30 November 1993
Audience:   College/higher education ,  Tertiary & Higher Education
Format:   Hardback
Publisher's Status:   Out of Print
Availability:   Awaiting stock   Availability explained

Table of Contents

Part 1: overview - Words, Roget, Books, Econ, Games, Miles, Plane, Lisa, Raman, Gates, Rand, Basic, Save; technicalities - representation of Graphs, Words, Roget, Books, Econ, Games, Miles, Plane; installation and use - how to obtain the files, installing CWEB, installing the graphbase, makefile details, troubleshooting, running the demos, storage considerations, running your own programs; how to read CWEB programs - programs of the Stanford GraphBase, ASSIGN_LISA, BOOK_COMPONENTS, ECON_ORDER, FOOTBALL, GB_BASIC, GB_BOOKS, GB_DIJK, GB_ECON, GB_FLIP, GB_GAMES, GB_GATES, GB_GRAPH, GB_IO, GB_LISA, GB_MILES, GB_PLANE, GB_RAMAN, GB_RAND, GB_ROGET, GB_SAVE, GB_SORT, GB_WORDS, GIRTH, LADDERS, MILES_SPAN, MULTIPLY, QUEEN, ROGET_COMPONENTS, TAKE_RISC, TEST_SAMPLE, WORD_COMPONENTS, index to all the programs. Appendices: error codes; summary of function calls - generators, nongenerators; example graph parameters - undirected graphs, directed graphs; 300 five-letter words.

Reviews

Author Information

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.

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

wl

Shopping Cart
Your cart is empty
Shopping cart
Mailing List