Klicka på en bild för att gå till Google Book Search.
Laddar... Implementing Discrete Mathematics: Combinatorics and Graph Theory With Mathematicaav Steven Skiena
Ingen/inga Laddar...
Gå med i LibraryThing för att få reda på om du skulle tycka om den här boken. Det finns inga diskussioner på LibraryThing om den här boken. Inga recensioner inga recensioner | lägg till en recension
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. Inga biblioteksbeskrivningar kunde hittas. |
Pågående diskussionerIngen/ingaPopulära omslagIngen/inga
Google Books — Laddar... GenrerMelvil Decimal System (DDC)511.6Natural sciences and mathematics Mathematics General Principles CombinatoricsKlassifikation enligt LCBetygMedelbetyg: Inga betyg.Är det här du? |