Description: Please refer to the section BELOW (and NOT ABOVE) this line for the product details - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Title:Graphs, Networks And AlgorithmsISBN13:9783642091865ISBN10:3642091865Author:Jungnickel, Dieter (Author)Description:From 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 More Transparent Binding:Paperback, PaperbackPublisher:SPRINGER NATUREPublication Date:2010-11-30Weight:2.04 lbsDimensions:1.35'' H x 9.21'' L x 6.14'' WNumber of Pages:650Language:English
Price: 106.55 USD
Location: USA
End Time: 2024-09-19T11:24:53.000Z
Shipping Cost: 0 USD
Product Images
Item Specifics
Return shipping will be paid by: Buyer
All returns accepted: Returns Accepted
Item must be returned within: 30 Days
Refund will be given as: Money Back
Return policy details:
Book Title: Graphs, Networks And Algorithms
Item Length: 9.3in.
Item Width: 6.1in.
Author: Dieter Jungnickel
Publication Name: Graphs, Networks and Algorithms
Format: Trade Paperback
Language: English
Publisher: Springer Berlin / Heidelberg
Series: Algorithms and Computation in Mathematics Ser.
Publication Year: 2010
Type: Textbook
Item Weight: 35.8 Oz
Number of Pages: Xx, 650 Pages