Articles liés à Graphs, Networks and Algorithms
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
À propos de l?auteur
Dieter Jungnickel is an internationally known mathematician working in the field of applied algebra, coding theory, design theory, finite geometry, codes and designs and combinatorial optimization.
He has published several well-known books, including "Optimization Methods", "Finite Fields", "Coding Theory" and "Graphs, Networks and Algorithms", some of which have been published both in English and German.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
- ÉditeurSpringer-Verlag Berlin and Heidelberg GmbH & Co. K
- Date d'édition2012
- ISBN 10 3642322778
- ISBN 13 9783642322778
- ReliureRelié
- Langueanglais
- Numéro d'édition4
- Nombre de pages676
- Coordonnées du fabricantnon disponible
Acheter neuf
Afficher cet article
EUR 82,78
EUR 2,89 expédition depuis Etats-Unis vers France
Destinations, frais et délais
Résultats de recherche pour Graphs, Networks and Algorithms
Image fournie par le vendeur
Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics, 5, Band 5)
Edité par
Springer, 2012
ISBN 10 : 3642322778
ISBN 13 : 9783642322778
Ancien ou d'occasion
Couverture rigide
Vendeur : Studibuch, Stuttgart, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
hardcover. Etat : Gut. 696 Seiten; 9783642322778.3 Gewicht in Gramm: 2. N° de réf. du vendeur 839727
Quantité disponible : 1 disponible(s)
Image d'archives
Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics, 5)
Edité par
Springer, 2012
ISBN 10 : 3642322778
ISBN 13 : 9783642322778
Ancien ou d'occasion
Couverture rigide
Vendeur : Phatpocket Limited, Waltham Abbey, HERTS, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. N° de réf. du vendeur Z1-Y-021-00632
Quantité disponible : 1 disponible(s)
Image d'archives
Graphs, Networks and Algorithms
Vendeur : Basi6 International, Irving, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. N° de réf. du vendeur ABEJUNE24-14613
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Graphs, Networks and Algorithms
Edité par
Springer Berlin Heidelberg, 2012
ISBN 10 : 3642322778
ISBN 13 : 9783642322778
Neuf
Couverture rigide
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Gebunden. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Thoroughly revised new editionFurther material addedAdditional exercisesAdditional referencesDieter Jungnickel is an internationally known mathematician working in the field of applied algebra, coding theory, design theory. N° de réf. du vendeur 5056870
Quantité disponible : Plus de 20 disponibles
Image d'archives
Graphs, Networks and Algorithms
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. pp. 696. N° de réf. du vendeur 2651413644
Quantité disponible : 1 disponible(s)
Image d'archives
Graphs, Networks and Algorithms
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. pp. 696 211 Illus. N° de réf. du vendeur 57097555
Quantité disponible : 1 disponible(s)
Image d'archives
Graphs, Networks and Algorithms
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. pp. 696. N° de réf. du vendeur 1851413638
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Graphs, Networks and Algorithms
Edité par
Springer Berlin Heidelberg, 2012
ISBN 10 : 3642322778
ISBN 13 : 9783642322778
Neuf
Couverture rigide
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 beenadded. N° de réf. du vendeur 9783642322778
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Graphs, Networks and Algorithms
Edité par
Springer Berlin Heidelberg Nov 2012, 2012
ISBN 10 : 3642322778
ISBN 13 : 9783642322778
Neuf
Buch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 696 pp. Englisch. N° de réf. du vendeur 9783642322778
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Graphs, Networks and Algorithms
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Nov 2012, 2012
ISBN 10 : 3642322778
ISBN 13 : 9783642322778
Neuf
Buch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : Neu. Neuware -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 2002The 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 2005Once 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 beenadded.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 696 pp. Englisch. N° de réf. du vendeur 9783642322778
Quantité disponible : 2 disponible(s)