Computational discrete mathematics : combinatorics and graph theory with Mathematica
Author(s)
Bibliographic Information
Computational discrete mathematics : combinatorics and graph theory with Mathematica
Cambridge University Press, 2009
- : pbk
Available at / 5 libraries
-
No Libraries matched.
- Remove all filters.
Note
Originally published : 2003
Includes bibliographical references and index
Description and Table of Contents
Description
This book was first published in 2003. Combinatorica, an extension to the popular computer algebra system Mathematica (R), is the most comprehensive software available for teaching and research applications of discrete mathematics, particularly combinatorics and graph theory. This book is the definitive reference/user's guide to Combinatorica, with examples of all 450 Combinatorica functions in action, along with the associated mathematical and algorithmic theory. The authors cover classical and advanced topics on the most important combinatorial objects: permutations, subsets, partitions, and Young tableaux, as well as all important areas of graph theory: graph construction operations, invariants, embeddings, and algorithmic graph theory. In addition to being a research tool, Combinatorica makes discrete mathematics accessible in new and exciting ways to a wide variety of people, by encouraging computational experimentation and visualization. The book contains no formal proofs, but enough discussion to understand and appreciate all the algorithms and theorems it contains.
Table of Contents
- 1. Combinatorica: an explorer's guide
- 2. Permutations and combinations
- 3. Algebraic combinatorics
- 4. Partitions, compositions and Young tableaux
- 5. Graph representation
- 6. Generating graphs
- 7. Properties of graphs
- 8. Algorithmic graph theory.
by "Nielsen BookData"