Graphs, Networks and Algorithms / by Dieter Jungnickel
(Algorithms and Computation in Mathematics ; 5)
| データ種別 | 電子ブック |
|---|---|
| 版 | Second Edition |
| 出版者 | Berlin, Heidelberg : Springer Berlin Heidelberg |
| 出版年 | 2005 |
| 本文言語 | 英語 |
| 大きさ | XVI, 612 p. 195 illus : online resource |
書誌詳細を非表示
| 内容注記 | 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 first edition: ".... 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. ..." Mathematical Reviews 2002 This thoroughly revised new edition offers a new chapter on the network simplex algorithm and a section on the five color theorem. Moreover, numerous smaller changes and corrections have been made and several recent developments have been discussed and referenced |
| 著者標目 | *Jungnickel, Dieter author SpringerLink (Online service) |
| 件 名 | LCSH:Mathematics LCSH:Computer science -- Mathematics 全ての件名で検索 LCSH:Mathematical optimization LCSH:Combinatorics FREE:Mathematics FREE:Combinatorics FREE:Optimization FREE:Mathematics of Computing |
| 分 類 | DC23:511.6 |
| 巻冊次 | ISBN:9783540269083 
|
| ISBN | 9783540269083 |
| URL | http://dx.doi.org/10.1007/b138283 |
目次／あらすじ