Discrete and combinatorial mathematics An applied introduction
The book introduces discrete methods that stress the finite nature inherent in many problems and structures; combinatorics - the algebra of enumeration, or counting; graph theory with its applications and interrelations with areas such as data structures and methodss of optimization; and finite alge...
Sparad:
| Huvudupphovsman: | |
|---|---|
| Materialtyp: | Bok |
| Språk: | Undetermined |
| Publicerad: |
Reading, Massachusetts
Addison-Wesley
1994
|
| Ämnen: | |
| Taggar: |
Lägg till en tagg
Inga taggar, Lägg till första taggen!
|
| Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Cần Thơ |
|---|
| Sammanfattning: | The book introduces discrete methods that stress the finite nature inherent in many problems and structures; combinatorics - the algebra of enumeration, or counting; graph theory with its applications and interrelations with areas such as data structures and methodss of optimization; and finite algebraic structures that arise in conjunction with disciplines such as coding theory, methods of enumeration, gating networks, and combinatorial designs |
|---|