Applied combinatorics
Author(s)
Bibliographic Information
Applied combinatorics
Prentice-Hall, c1984
Available at 26 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
Description and Table of Contents
Description
Our most applied text, including topics in optimization.
Table of Contents
Notation. 1. What is Combinatorics? I. The Basic Tools of Combinatorics. 2. Basic Counting Rules 3. Introduction to Graph Theory. II. The Counting Problem. 4. Generating Functions and Their Applications. 5. Recurrence Relations. 7. The Polya Theory of Counting. III. The Existence Problem. 8. The Pigeonhole Principle and its Generalizations. 9. Experimental Design. 10. Coding Theory. 11. Existence Problems in Graph Theory. IV. Combinatorial Optimization. 12. Matching and Covering. 13. Optimization Problems for Graphs and Networks. Answers to Selected Exercises. Author Index. Subject Index.
by "Nielsen BookData"