Items related to Graphs, Networks and Algorithms: 5 (Algorithms and...
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 beenadded.
"synopsis" may belong to another edition of this title.
About the Author
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.
From the Back Cover
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 forthe more general Berge-Tutte formula. Several recent research developments are discussed and quite a few references have been added.
"About this title" may belong to another edition of this title.
- PublisherSpringer
- Publication date2012
- ISBN 10 3642322778
- ISBN 13 9783642322778
- BindingHardcover
- LanguageEnglish
- Edition number4
- Number of pages696
Buy New
View this item
£ 71.46
FREE shipping from U.S.A. to United Kingdom
Destination, rates & speeds
Search results for Graphs, Networks and Algorithms: 5 (Algorithms and...
Stock Image
Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics, 5)
Seller: Phatpocket Limited, Waltham Abbey, HERTS, United Kingdom
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # Z1-Y-021-00632
Quantity: 1 available
Seller Image
Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics, 5, Band 5)
Seller: Studibuch, Stuttgart, Germany
Seller rating 5 out of 5 stars
hardcover. Condition: Gut. 696 Seiten; 9783642322778.3 Gewicht in Gramm: 2. Seller Inventory # 839727
Quantity: 1 available
Stock Image
Graphs, Networks and Algorithms
Seller: Basi6 International, Irving, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Seller Inventory # ABEJUNE24-14613
Quantity: 1 available
Stock Image
Graphs, Networks and Algorithms
Seller: Majestic Books, Hounslow, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. pp. 696 211 Illus. Seller Inventory # 57097555
Quantity: 1 available
Stock Image
Graphs, Networks and Algorithms
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 696. Seller Inventory # 2651413644
Quantity: 1 available
Stock Image
Graphs, Networks and Algorithms
Seller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 5 out of 5 stars
Condition: New. pp. 696. Seller Inventory # 1851413638
Quantity: 1 available
Stock Image
Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics, 5)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In English. Seller Inventory # ria9783642322778_new
Quantity: Over 20 available
Seller Image
Graphs, Networks and Algorithms
Published by
Springer Berlin Heidelberg, 2012
ISBN 10: 3642322778
ISBN 13: 9783642322778
New
Hardcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Gebunden. Condition: 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. Seller Inventory # 5056870
Quantity: Over 20 available
Seller Image
Graphs, Networks and Algorithms
Published by
Springer Berlin Heidelberg Nov 2012, 2012
ISBN 10: 3642322778
ISBN 13: 9783642322778
New
Buch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Buch. Condition: 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. Seller Inventory # 9783642322778
Quantity: 2 available
Seller Image
Graphs, Networks and Algorithms
Published by
Springer Berlin Heidelberg, 2012
ISBN 10: 3642322778
ISBN 13: 9783642322778
New
Hardcover
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Buch. Condition: 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. Seller Inventory # 9783642322778
Quantity: 1 available