Graphs, Networks and Algorithms / by Dieter Jungnickel
(Algorithms and Computation in Mathematics ; 5)
| データ種別 | 電子ブック |
|---|---|
| 出版情報 | Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer , 1999 |
| 本文言語 | 英語 |
| 大きさ | XII, 589 p : online resource |
書誌詳細を非表示
| 内容注記 | 1. Basic Graph Theory 2. Algorithms and Complexity 3. Shortest Paths 4. Spanning Trees 5. The Greedy Algorithm 6. Flows 7. Applications in Combinatorics 8. Colourings 9. Circulations 10. Synthesis of Networks 11. Connectivity 12. Matchings 13. Weighted Matchings 14. A Hard Problem: The TSP A. Solutions B. List of Symbols References |
|---|---|
| 一般注記 | 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 |
| 著者標目 | *Jungnickel, Dieter author SpringerLink (Online service) |
| 件 名 | LCSH:Mathematics LCSH:Combinatorics FREE:Mathematics FREE:Combinatorics |
| 分 類 | DC23:511.6 |
| 巻冊次 | ISBN:9783662038222 
|
| ISBN | 9783662038222 |
| URL | http://dx.doi.org/10.1007/978-3-662-03822-2 |
目次／あらすじ