Graphs, networks and algorithms

書誌事項

Graphs, networks and algorithms

Dieter Jungnickel

(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」 より

関連文献: 1件中  1-1を表示

詳細情報

  • NII書誌ID(NCID)
    BA38205156
  • ISBN
    • 3540637605
  • LCCN
    98041497
  • 出版国コード
    gw
  • タイトル言語コード
    eng
  • 本文言語コード
    eng
  • 原本言語コード
    ger
  • 出版地
    Berlin ; Tokyo
  • ページ数/冊数
    xii, 589 p.
  • 大きさ
    24 cm
  • 分類
  • 件名
  • 親書誌ID
ページトップへ