<電子ブック>
Graphs, Networks and Algorithms / by Dieter Jungnickel
(Algorithms and Computation in Mathematics ; 5)
版 | 3rd ed. 2008. |
---|---|
出版者 | (Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer) |
出版年 | 2008 |
本文言語 | 英語 |
大きさ | XX, 650 p. 209 illus : online resource |
著者標目 | *Jungnickel, Dieter author SpringerLink (Online service) |
件 名 | LCSH:Mathematical analysis LCSH:Discrete mathematics LCSH:Mathematical optimization LCSH:Computer science -- Mathematics 全ての件名で検索 FREE:Analysis FREE:Discrete Mathematics FREE:Optimization FREE:Mathematics of Computing |
一般注記 | Basic Graph Theory -- Algorithms and Complexity -- Shortest Paths -- Spanning Trees -- The Greedy Algorithm -- Flows -- Combinatorial Applications -- Connectivity and Depth First Search -- Colorings -- Circulations -- The Network Simplex Algorithm -- Synthesis of Networks -- Matchings -- Weighted matchings -- A Hard Problem: The TSP From the reviews of the previous editions ".... The book is a first class textbook and seems to be indispensable for everybody who has to teach combinatorial optimization. It is very helpful for students, teachers, and researchers in this area. The author finds a striking synthesis of nice and interesting mathematical results and practical applications. ... the author pays much attention to the inclusion of well-chosen exercises. The reader does not remain helpless; solutions or at least hints are given in the appendix. Except for some small basic mathematical and algorithmic knowledge the book is self-contained. ..." K.Engel, Mathematical Reviews 2002 The substantial development effort of this text, involving multiple editions and trailing in the context of various workshops, university courses and seminar series, clearly shows through in this new edition with its clear writing, good organisation, comprehensive coverage of essential theory, and well-chosen applications. The proofs of important results and the representation of key algorithms in a Pascal-like notation allow this book to be used in a high-level undergraduate or low-level graduate course on graph theory, combinatorial optimization or computer science algorithms. The well-worked solutions to exercises are a real bonus for self study by students. The book is highly recommended. P .B. Gibbons, Zentralblatt für Mathematik 1061, 2005 The third edition of this standard textbook contains additional material: two new application sections (on graphical codes and their decoding) and about two dozen further exercises (with solutions, as throughout the text). Moreover, recent developments have been discussed and referenced, in particular for the travelling salesman problem. The presentation has been improved in many places (for instance, in the chapters on shortest paths and on colorings), and a number of proofs have been reorganized, making them more precise or moretransparent HTTP:URL=https://doi.org/10.1007/978-3-540-72780-4 |
目次/あらすじ
所蔵情報を非表示
電子ブック | 配架場所 | 資料種別 | 巻 次 | 請求記号 | 状 態 | 予約 | コメント | ISBN | 刷 年 | 利用注記 | 指定図書 | 登録番号 |
---|---|---|---|---|---|---|---|---|---|---|---|---|
電子ブック | オンライン | 電子ブック |
|
Springer eBooks | 9783540727804 |
|
電子リソース |
|
EB00228715 |
書誌詳細を非表示
データ種別 | 電子ブック |
---|---|
分 類 | LCC:QA299.6-433 DC23:515 |
書誌ID | 4000116188 |
ISBN | 9783540727804 |
類似資料
この資料の利用統計
このページへのアクセス回数:2回
※2017年9月4日以降