Parameter
- 334 Seiten
- 12 Lesestunden
Mehr zum Buch
<div>This book concentrates on two distinct areas in discrete mathematics. The first section deals with combinatorics, loosely defined as the study of counting. We provide functions for generating combinatorial objects such as permutations, partitions, and Young tableaux, as well as for studying various aspects of these structures.The second section considers graph theory, which can be defined equally loosely as the study of binary relations. We consider a wide variety of graphs, provide functions to create them, and functions to show what special properties they have, Although graphs are combinatorial structures, understanding them requires pictures or embeddings. Thus we provide functions to create a variety of graph embeddings, so the same structure can be viewed in several different ways. Algorithmic graph theory is an important interface between mathematics and computer science, and so we study a variety of polynominal and exponential time problems.</div>
Buchkauf
Implementing Discrete Mathematics, Steven Skiena
- Sprache
- Erscheinungsdatum
- 1990
- Einband
- (Hardcover)
Keiner hat bisher bewertet.
- Titel
- Implementing Discrete Mathematics
- Untertitel
- Combinatorics And Graph Theory With Mathematica
- Sprache
- Englisch
- Autor*innen
- Steven Skiena
- Verlag
- Basic Books
- Erscheinungsdatum
- 1990
- Einband
- Hardcover
- Seitenzahl
- 334
- ISBN10
- 0201509431
- ISBN13
- 9780201509434
- Reihe
- Schlagwörter
- Beschreibung
- <div>This book concentrates on two distinct areas in discrete mathematics. The first section deals with combinatorics, loosely defined as the study of counting. We provide functions for generating combinatorial objects such as permutations, partitions, and Young tableaux, as well as for studying various aspects of these structures.The second section considers graph theory, which can be defined equally loosely as the study of binary relations. We consider a wide variety of graphs, provide functions to create them, and functions to show what special properties they have, Although graphs are combinatorial structures, understanding them requires pictures or embeddings. Thus we provide functions to create a variety of graph embeddings, so the same structure can be viewed in several different ways. Algorithmic graph theory is an important interface between mathematics and computer science, and so we study a variety of polynominal and exponential time problems.</div>