Graphs, Networks and Algorithms
5.0
Reviews from our users
You Can Ask your questions from this book's AI after Login
Each download or ask from book AI costs 2 points. To earn more free points, please visit the Points Guide Page and complete some valuable actions.Related Refrences:
From the reviews of the German edition: "Combinatorial optimization, along with graph algorithms and complexity theory is booming. This book treats the most prominent problems which are polynomially solvable. The Traveling Salesman Problem is discussed as a paradigm of an NP-complete problem. The text is well written, most exercises are quite enlightening and the hints are clear. Algorithms are described very thoroughly. The list of references is impressive and gives good guidance for further reading. The book can be recommended to beginners as an introductory text as well as for research and industry as a reference." (OPTIMA) In this corrected 2nd printing of the first edition the author has made some small modifications: some minor mistakes were corrected and updates to the bibliography provided.
Free Direct Download
You Can Download this book after Login
Accessing books through legal platforms and public libraries not only supports the rights of authors and publishers but also contributes to the sustainability of reading culture. Before downloading, please take a moment to consider these options.
Find this book on other platforms:
WorldCat helps you find books in libraries worldwide.
See ratings, reviews, and discussions on Goodreads.
Find and buy rare or used books on AbeBooks.
1220
بازدید5.0
امتیاز0
نظر98%
رضایتReviews:
5.0
Based on 0 users review
Questions & Answers
Ask questions about this book or help others by answering
No questions yet. Be the first to ask!