Graphs, networks and algorithms
著者
書誌事項
Graphs, networks and algorithms
(Algorithms and computation in mathematics, v. 5)
Springer, c1999
大学図書館所蔵 全51件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
"With 200 figures translated from the German by Tilla Schade"
"The English edition is based on the third German edition published by Bibliographisches Institut Wissenschaftsverlag in 1994" -- T.p. verso
Includes bibliographical references (p. [551]-575) and index
内容説明・目次
内容説明
From the reviews of the German edition:"Combinatorial optimization, along with graph algorithms and complexity theory is booming. This book treats the most prominent problems which are polynomially solvable. The Traveling Salesman Problem is discussed as a paradigm of an NP-complete problem. The text is well written, most exercises are quite enlightening and the hints are clear. Algorithms are described very thoroughly. The list of references is impressive and gives good guidance for further reading. The book can be recommended to beginners as an introductory text as well as for research and industry as a reference. "(OPTIMA)In this corrected 2nd printing of the first edition the author has made some small modifications: some minor mistakes were corrected and updates to the bibliography provided.
目次
Preface * Basic Graph Theory * Algorithms and Complexity * Shortest Paths * Spanning Trees * The Greedy Algorithm * Flows * Applications in Combinatorics * Colourings * Circulations * Synthesis of Networks * Connectivity * Matchings * Weighted Matchings * A Hard Problem: The TSP * Appendix A: Solutions * Appendix B: List of Symbols * References * Index.
「Nielsen BookData」 より