Applied combinatorics
Author(s)
Bibliographic Information
Applied combinatorics
Wiley & Sons, c1995
3rd ed
- [International ed.] : pbk
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 index
Description and Table of Contents
- Volume
-
[International ed.] : pbk ISBN 9780471110910
Description
Intended for second/third year courses in combinatorics or discrete structures/methods, this text seeks to develop the problem-solving skills in applied combinatorial mathematics which are necessary in computer science and decision science fields such as operations research and managerial science. Discrete methods in counting and graph theory are developed in a problem-solving setting. The book includes many applications to computer science, operations research and statistics.
Table of Contents
- Part One: Graph Theory: Elements of Graph Theory
- Covering Circuits and Graph Colouring
- Trees and Searching
- Network Algorithms
- Part Two: Enumeration: Generating Counting Methods for Selections and Arrangements
- Generating Functions
- Recurrence Relations
- Inclusion-Exclusion
- Part Three: Additional Topics: Polya's Enumeration Theorem
- Games with Graphs.
- Volume
-
ISBN 9780471595045
Description
Intended for second/third year courses in combinatorics or discrete structures/methods, this text seeks to develop the problem-solving skills in applied combinatorial mathematics which are necessary in computer science and decision science fields such as operations research and managerial science. Discrete methods in counting and graph theory are developed in a problem-solving setting. The book includes any applications to computer science, operations research and statistics.
Table of Contents
- Part One: Graph Theory: Elements of Graph Theory
- Covering Circuits and Graph Colouring
- Trees and Searching
- Network Algorithms
- Part Two: Enumeration: Generating Counting Methods for Selections and Arrangements
- Generating Functions
- Recurrence Relations
- Inclusion-Exclusion
- Part Three: Additional Topics: Polya's Enumeration Theorem
- Games with Graphs.
by "Nielsen BookData"