Graphs, Networks and Algorithms: Algorithms and Computation in Mathematics, cartea 5
Autor Dieter Jungnickelen Limba Engleză Paperback – 30 noi 2010
The substantial development effort of this text 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.
Zentralblatt für Mathematik 2005
The third edition of this standard textbook contains additional material: two new application sections (on graphical codes and their decoding) and about two dozen further exercises (with solutions, as throughout the text). Moreover, recent developments have been discussed and referenced, in particular for the travelling salesman problem. The presentation has been improved in many places (for instance, in the chapters on shortest paths and on colorings), and a number of proofs have been reorganized, making them more precise or more transparent.
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (2) | 540.24 lei 38-45 zile | |
| Springer Berlin, Heidelberg – 14 dec 2014 | 540.24 lei 38-45 zile | |
| Springer Berlin, Heidelberg – 30 noi 2010 | 627.89 lei 6-8 săpt. | |
| Hardback (1) | 640.81 lei 6-8 săpt. | |
| Springer Berlin, Heidelberg – 9 noi 2012 | 640.81 lei 6-8 săpt. |
Din seria Algorithms and Computation in Mathematics
- 15%
Preț: 645.21 lei - 18%
Preț: 871.29 lei - 15%
Preț: 675.58 lei - 18%
Preț: 700.72 lei - 15%
Preț: 579.20 lei -
Preț: 470.24 lei - 15%
Preț: 618.19 lei -
Preț: 389.65 lei -
Preț: 386.74 lei - 18%
Preț: 710.11 lei -
Preț: 382.85 lei - 18%
Preț: 1077.53 lei - 15%
Preț: 635.44 lei - 20%
Preț: 631.00 lei - 15%
Preț: 460.83 lei -
Preț: 382.30 lei - 15%
Preț: 568.35 lei -
Preț: 378.41 lei - 20%
Preț: 317.85 lei - 18%
Preț: 924.99 lei - 23%
Preț: 690.82 lei - 15%
Preț: 573.56 lei -
Preț: 383.03 lei - 18%
Preț: 756.50 lei - 18%
Preț: 727.69 lei - 20%
Preț: 1109.08 lei - 18%
Preț: 928.03 lei - 20%
Preț: 328.48 lei - 15%
Preț: 640.81 lei
Preț: 627.89 lei
Preț vechi: 738.69 lei
-15% Nou
Puncte Express: 942
Preț estimativ în valută:
111.09€ • 129.62$ • 97.13£
111.09€ • 129.62$ • 97.13£
Carte tipărită la comandă
Livrare economică 16-30 ianuarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642091865
ISBN-10: 3642091865
Pagini: 672
Ilustrații: XX, 650 p. 209 illus.
Dimensiuni: 155 x 235 x 35 mm
Greutate: 0.93 kg
Ediția:Softcover reprint of hardcover 3rd ed. 2008
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Algorithms and Computation in Mathematics
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642091865
Pagini: 672
Ilustrații: XX, 650 p. 209 illus.
Dimensiuni: 155 x 235 x 35 mm
Greutate: 0.93 kg
Ediția:Softcover reprint of hardcover 3rd ed. 2008
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Algorithms and Computation in Mathematics
Locul publicării:Berlin, Heidelberg, Germany
V-ar putea interesa
-
Introduction to Graph TheoryRobin J. WilsonPreț: 384.28 lei -
-18%Preț: 1182.77 lei1442.40 lei -
Designs and Finite GeometriesDieter Jungnickel-18%Preț: 1173.54 lei1431.15 lei -
Preț: 328.22 lei -
Enumerative Combinatorics: Volume 1Richard P. Stanley-8%Preț: 419.27 lei455.72 lei -
Combinatorics – An IntroductionTG Faticoni-23%Preț: 590.23 lei766.53 lei -
Designs and Finite GeometriesDieter Jungnickel-18%Preț: 1167.76 lei1424.11 lei -
A Course in Topological CombinatoricsMark de LonguevillePreț: 434.80 lei -
-23%Preț: 702.40 lei912.21 lei -
-15%Preț: 566.44 lei666.41 lei -
Mathematics and Culture VMichele Emmer-20%Preț: 255.89 lei319.86 lei -
Optimierungsmethoden: Eine EinführungDieter JungnickelPreț: 210.76 lei -
-18%Preț: 917.27 lei1118.62 lei -
Preț: 228.95 lei -
Introduction to the Analysis of Algorithms, an (2nd Edition)Michael SoltysPreț: 436.90 lei -
Spanning Tree Results for Graphs and MultigraphsJohn T. Saccoman-15%Preț: 482.18 lei567.28 lei -
Crystal BasesDaniel BumpPreț: 395.95 lei
Public țintă
ResearchCuprins
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.
Recenzii
From reviews:
“.... 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)
“This book has been a pleasure to read and review. Its title is brief and self-explanatory, and the book has been well-produced and designed for both reference and systematic use. .... Firstly, it is an extremely clear text; ... Secondly, the author is not ashamed to introduce practice and illustrations, so that this is not a “dry-as-dust” text in esoteric mathematics. Algorithms are presented in pseudocode, and their workings are thoroughly discussed. It is a comprehensive book. ... Therefore, if you have the slightest interest in the algorithms for graphs and networks, or in the theory of such models, then Jungnickel has produced a book that you ought to have available for reference.” (David K. Smith, University of Exeter, Journal of the Operational Research Society, 50 (1999)
“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 graphtheory, 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.” (Peter B. Gibbons, Auckland, Zentralblatt für Mathematik 1061, 2005)
From the reviews of the second edition:
"This book … beginning from the very basic definitions of graph theory, quickly building a catalog of theorems, and ending with a complex suite of algorithms on graphs and networks. … At the end is a collection of NP-complete problems and an extensive bibliography. This text is suitable for graduate courses in combinatorics and graph theory, as well as for independent study and research by students, mathematicians, and professionals. It is a welcome addition to the library of choices of textbooks for these subjects." (William Fahle, SIGACT News, Vol. 36 (4), 2005)
From the reviews of the third edition:
"The third edition of this standard textbook contains further new material on graphical codes and their decoding, and many additional exercises. … The focus on algorithmic issues motivates challenging questions, and connects the presentation to many real applications. … appropriate for computer science and engineering students, in addition to students of mathematics. The diversity of applications represented is a real strength of the text. … provides connections to other areas of mathematics, and applications, that serve to motivate students. The book is highly recommended." (Charles J. Colbourn, Zentralblatt MATH, Vol. 1126 (3), 2008)
“The book treats the most important algorithmic problems concerning graphs and networks which are polynomially solvable. … The book is well written, clear and understandable and can also be recommended as text book for students and beginners in this field. There are many exercises (with solutions) and examples. It is an indispensable reference for anyone working with algorithmsand networks. The list of references is extensive.” (B. Krön, Monatshefte für Mathematik, Vol. 154 (4), August, 2008)
“.... 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)
“This book has been a pleasure to read and review. Its title is brief and self-explanatory, and the book has been well-produced and designed for both reference and systematic use. .... Firstly, it is an extremely clear text; ... Secondly, the author is not ashamed to introduce practice and illustrations, so that this is not a “dry-as-dust” text in esoteric mathematics. Algorithms are presented in pseudocode, and their workings are thoroughly discussed. It is a comprehensive book. ... Therefore, if you have the slightest interest in the algorithms for graphs and networks, or in the theory of such models, then Jungnickel has produced a book that you ought to have available for reference.” (David K. Smith, University of Exeter, Journal of the Operational Research Society, 50 (1999)
“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 graphtheory, 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.” (Peter B. Gibbons, Auckland, Zentralblatt für Mathematik 1061, 2005)
From the reviews of the second edition:
"This book … beginning from the very basic definitions of graph theory, quickly building a catalog of theorems, and ending with a complex suite of algorithms on graphs and networks. … At the end is a collection of NP-complete problems and an extensive bibliography. This text is suitable for graduate courses in combinatorics and graph theory, as well as for independent study and research by students, mathematicians, and professionals. It is a welcome addition to the library of choices of textbooks for these subjects." (William Fahle, SIGACT News, Vol. 36 (4), 2005)
From the reviews of the third edition:
"The third edition of this standard textbook contains further new material on graphical codes and their decoding, and many additional exercises. … The focus on algorithmic issues motivates challenging questions, and connects the presentation to many real applications. … appropriate for computer science and engineering students, in addition to students of mathematics. The diversity of applications represented is a real strength of the text. … provides connections to other areas of mathematics, and applications, that serve to motivate students. The book is highly recommended." (Charles J. Colbourn, Zentralblatt MATH, Vol. 1126 (3), 2008)
“The book treats the most important algorithmic problems concerning graphs and networks which are polynomially solvable. … The book is well written, clear and understandable and can also be recommended as text book for students and beginners in this field. There are many exercises (with solutions) and examples. It is an indispensable reference for anyone working with algorithmsand networks. The list of references is extensive.” (B. Krön, Monatshefte für Mathematik, Vol. 154 (4), August, 2008)
Textul de pe ultima copertă
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 1061, 2005
The third edition of this standard textbook contains additional material: two new application sections (on graphical codes and their decoding) and about two dozen further exercises (with solutions, as throughout the text). Moreover, recent developments have been discussed and referenced, in particular for the travelling salesman problem. The presentation has been improved in many places (for instance, in the chapters on shortest paths and on colorings), and a number of proofs have been reorganized, making them more precise or moretransparent.
".... 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 1061, 2005
The third edition of this standard textbook contains additional material: two new application sections (on graphical codes and their decoding) and about two dozen further exercises (with solutions, as throughout the text). Moreover, recent developments have been discussed and referenced, in particular for the travelling salesman problem. The presentation has been improved in many places (for instance, in the chapters on shortest paths and on colorings), and a number of proofs have been reorganized, making them more precise or moretransparent.
Caracteristici
Includes supplementary material: sn.pub/extras
Notă biografică
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.
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.