Graphs, Networks and Algorithms - Info and Reading Options
By Dieter Jungnickel
"Graphs, Networks and Algorithms" was published by Springer London, Limited in 2013 - Berlin, Heidelberg, it has 589 pages and the language of the book is English.
“Graphs, Networks and Algorithms” Metadata:
- Title: ➤ Graphs, Networks and Algorithms
- Author: Dieter Jungnickel
- Language: English
- Number of Pages: 589
- Publisher: Springer London, Limited
- Publish Date: 2013
- Publish Location: Berlin, Heidelberg
“Graphs, Networks and Algorithms” Subjects and Themes:
- Subjects: ➤ Optimization - Computer science - Mathematics - Mathematical optimization - Mathematics of Computing - Combinatorial analysis - Combinatorial optimization - Graph theory - Algorithms
Edition Specifications:
- Pagination: xii, 589
Edition Identifiers:
- The Open Library ID: OL37232339M - OL19853384W
- ISBN-13: 9783662038222
- All ISBNs: 9783662038222
AI-generated Review of “Graphs, Networks and Algorithms”:
"Graphs, Networks and Algorithms" Description:
The Open Library:
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.
Open Data:
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
Read “Graphs, Networks and Algorithms”:
Read “Graphs, Networks and Algorithms” by choosing from the options below.
Search for “Graphs, Networks and Algorithms” downloads:
Visit our Downloads Search page to see if downloads are available.
Find “Graphs, Networks and Algorithms” in Libraries Near You:
Read or borrow “Graphs, Networks and Algorithms” from your local library.
- The WorldCat Libraries Catalog: Find a copy of “Graphs, Networks and Algorithms” at a library near you.
Buy “Graphs, Networks and Algorithms” online:
Shop for “Graphs, Networks and Algorithms” on popular online marketplaces.
- Ebay: New and used books.