Graphs, Networks and Algorithms
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 int...
Enregistré dans:
| Hovedforfatter: | |
|---|---|
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin, Heidelberg :
Springer Berlin Heidelberg
[20..].
Cham : Springer Nature |
| Udgivelse: | Second Edition. |
| Serier: | Algorithms and Computation in Mathematics
5 |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
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, 2nd ed, Berlin, Springer, 2005, 1 vol. (XVI-611 p.), Algorithms and computation in mathematics, 3-540-21905-6 • Graphs, Networks and Algorithms, Texte imprimé, 9783540801702 • Graphs, networks, and algorithms, Dieter Jungnickel, 2nd ed, Berlin, Springer, 2005, 1 vol. (XVI-611 p.), Algorithms and computation in mathematics, 3-540-21905-6 |
Indholdsfortegnelse:
- 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