000			02561nam a22002177a 4500
005			20220421121905.0
008			220304b ||||| |||| 00| 0 eng d
020			_a9788181285188
040			_cAL
041			_aeng
082			_223 _a511.5 _bJUNG
100			_aDieter Jungnickel _922778
245			_aGraphs networks and algorithms
250			_a2nd ed.
260			_aNew York _bSpringer _c2009
300			_axvi,611p. _bHB _c24x16cm.
365			_2General _aVBI-1350 _b₹746.25 _c₹ _d₹995.00 _e25% _f21-02-2022
520			_aFrom 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 organization, 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 Mathematic 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 more transparent. (less)
650			_2Mathematics _aGraph Theory _922779
942			_2ddc _cBK
999			_c221719 _d221719