Graphs, Networks and Algorithms by Dieter Jungnickel.

By:

Jungnickel, Dieter [author.]

Material type: Text

TextSeries: Algorithms and Computation in Mathematics ; 5Description: xvi,611p.; illusISBN:

9783662038222
9788181285188

Subject(s):

Additional physical formats: Printed edition:: No titleDDC classification:

511.6 23

LOC classification:

QA164-167.2

Online resources:

Full text available from SpringerLink ebooks - Mathematics and Statistics (Archive)

Contents:

1. Basic Graph Theory -- 2. Algorithms and Complexity -- 3. Shortest Paths -- 4. Spanning Trees -- 5. The Greedy Algorithm -- 6. Flows -- 7. Applications in Combinatorics -- 8. Colourings -- 9. Circulations -- 10. Synthesis of Networks -- 11. Connectivity -- 12. Matchings -- 13. Weighted Matchings -- 14. A Hard Problem: The TSP -- A. Solutions -- B. List of Symbols -- References.

In: Springer eBooksSpringerLink ebooks - Mathematics and Statistics (Archive)Summary: 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.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Call number	Status	Barcode
General Collection	Main Campus Library	QA 402.5 .J8913 2005 (Browse shelf(Opens below))	Available	20091547

Browsing Main Campus Library shelves Close shelf browser (Hides shelf browser)

Previous								Next
Previous	QA402.35 .N66 2010 Nonlinear Control Systems with Discontinuity: Theory and practice/	QA 402.5 .C64 2000 Trust-region methods /	QA 402.5 .C64 2000 Trust-region methods /	QA 402.5 .J8913 2005 Graphs, Networks and Algorithms	QA402.5 .N62 2006 Numerical optimization /	QA 403 .B377 1997 Harmonic analysis and applications /	QA 403 .B377 1997 Harmonic analysis and applications /	Next

Includes bibliographic references and index.

License restrictions may limit access.

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.

There are no comments on this title.

to post a comment.