Narrow your search
Listing 1 - 9 of 9
Sort by

Book
Mariages Stables Et Leurs Relations Avec d'Autres Problemes Combinatoires
Author:
ISBN: 0840503423 9780840503428 Year: 1976 Publisher: Montreal: Presses de l'Université de Montréal,

Loading...
Export citation

Choose an application

Bookmark

Abstract

The Stanford GraphBase : a platform for combinatorial computing
Author:
ISBN: 0201542757 0135238250 9780201542752 Year: 1993 Publisher: Reading (Mass.) : Addison-Wesley,

Loading...
Export citation

Choose an application

Bookmark

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.

Stable marriage and its relation to other combinatorial problems
Author:
ISBN: 0821806033 9780821806036 Year: 1997 Volume: 10 Publisher: Providence (R.I.): American mathematical society,

Analysis and design of algorithms for combinatorial problems
Authors: --- ---
ISBN: 0444876995 9780444876997 9780080872209 0080872204 1281788279 9781281788276 9786611788278 6611788271 Year: 1985 Volume: 25 109 Publisher: Amsterdam ; New York : New York, N.Y., U.S.A. : North-Holland ; Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co.,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Combinatorial problems have been from the very beginning part of the history of mathematics. By the Sixties, the main classes of combinatorial problems had been defined. During that decade, a great number of research contributions in graph theory had been produced, which laid the foundations for most of the research in graph optimization in the following years. During the Seventies, a large number of special purpose models were developed. The impressive growth of this field since has been strongly determined by the demand of applications and influenced by the technological increases in compu

Listing 1 - 9 of 9
Sort by