Applied combinatorics
Author(s)
Bibliographic Information
Applied combinatorics
Pearson/Prentice Hall, c2005
2nd ed
Available at 4 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographies and indexes
Previous edition: 1984
Description and Table of Contents
Description
For courses in undergraduate Combinatorics for juniors or seniors.
This carefully crafted text emphasizes applications and problem solving. It is divided into 4 parts. Part I introduces basic tools of combinatorics, Part II discusses advanced tools, Part III covers the existence problem, and Part IV deals with combinatorial optimization.
Table of Contents
1. What Is Combinatorics?
2. Basic Counting Rules.
3. Introduction to Graph Theory.
4. Generating Functions and Their Applications.
5. Recurrence Relations.
6. The Principle of Inclusion and Exclusion.
7. The Polya Theory of Counting.
8. Experimental Design.
9. Coding Theory.
10. Existence Problems in Graph Theory.
11. Matching and Covering.
12. Optimization Problems for Graphs and Networks.
by "Nielsen BookData"