Graphs, networks and algorithms
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...
保存先:
| 第一著者: | |
|---|---|
| フォーマット: | Livre numérique |
| 言語: | Anglais |
| 出版事項: |
Berlin, Heidelberg :
Springer Berlin Heidelberg
[20..].
Cham : Springer Nature |
| 版: | 4th ed. 2013. |
| シリーズ: | Algorithms and Computation in Mathematics
|
| オンライン･アクセス: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| 注記: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Graphs, networks and algorithms, Dieter Jungnickel, Fourth eddition, Berlin, Springer-Verlag, 2013, 1 vol. (XX-675 p.), Algorithms and computation in mathematics, 978-3-642-32277-8 • Graphs, networks and algorithms, Dieter Jungnickel, Fourth eddition, Berlin, Springer-Verlag, 2013, 1 vol. (XX-675 p.), Algorithms and computation in mathematics, 978-3-642-32277-8 • Graphs, Networks and Algorithms, Texte imprimé, 9783642436642 • Graphs, Networks and Algorithms, Texte imprimé, 9783642322792 |
目次:
- Prefaces 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 Appendix A: Some NP-Complete Problems Appendix B: Solutions Appendix C: List of Symbols References Index