Applied combinatorics
著者
書誌事項
Applied combinatorics
Wiley & Sons, c1995
3rd ed
- [International ed.] : pbk
大学図書館所蔵 全26件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes index
内容説明・目次
- 巻冊次
-
[International ed.] : pbk ISBN 9780471110910
内容説明
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.
目次
- 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.
- 巻冊次
-
ISBN 9780471595045
内容説明
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.
目次
- 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.
「Nielsen BookData」 より