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 |
| LEADER | 04666nam a22003617a 4500 | ||
|---|---|---|---|
| 001 | 950091 | ||
| 008 | 130325q2000 xx ||| |||| 00| 0 eng d | ||
| 009 | PPN168321440 | ||
| 020 | |a 9783642322785 | ||
| 041 | 0 | |a eng | |
| 082 | |a 511.6 | ||
| 100 | 1 | |a Jungnickel, Dieter, |d 1952- | |
| 245 | 1 | 0 | |a Graphs, networks and algorithms |c by Dieter Jungnickel. |
| 250 | |a 4th ed. 2013. | ||
| 260 | |a Berlin, Heidelberg : |b Springer Berlin Heidelberg. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Algorithms and Computation in Mathematics | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 1 | |a 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 | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a 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 2005 Once again, the new edition has been thoroughly revised. In particular, some further material has been added: more on NP-completeness (especially on dominating sets), a section on the Gallai-Edmonds structure theory for matchings, and about a dozen additional exercises as always, with solutions. Moreover, the section on the 1-factor theorem has been completely rewritten: it now presents a short direct proof for the more general Berge-Tutte formula. Several recent research developments are discussed and quite a few references have been added | ||
| 776 | 0 | |0 167762001 |t Graphs, networks and algorithms |f Dieter Jungnickel |e Fourth eddition |c Berlin |n Springer-Verlag |d 2013 |p 1 vol. (XX-675 p.) |s Algorithms and computation in mathematics |z 978-3-642-32277-8 | |
| 776 | 0 | |0 167762001 |t Graphs, networks and algorithms |f Dieter Jungnickel |e Fourth eddition |c Berlin |n Springer-Verlag |d 2013 |p 1 vol. (XX-675 p.) |s Algorithms and computation in mathematics |z 978-3-642-32277-8 | |
| 776 | 0 | |t Graphs, Networks and Algorithms |b Texte imprimé |z 9783642436642 | |
| 776 | 0 | |t Graphs, Networks and Algorithms |b Texte imprimé |z 9783642322792 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/978-3-642-32278-5 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-X6QTZ4P0-4 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:748060677 |u https://ezproxy.univ-orleans.fr/login?url=https://dx.doi.org/10.1007/978-3-642-32278-5 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:751512214 |u https://ezproxy.insa-cvl.fr/login?qurl=https://dx.doi.org/10.1007/978-3-642-32278-5 |z Accès INSA CVL | |
| 997 | |0 950091 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||