๐”– Scriptorium
โœฆ   LIBER   โœฆ
๐Ÿ“

Graphs, Networks and Algorithms

โœ Scribed by Dieter Jungnickel (auth.)

Publisher
Springer
Year
2008
Tongue
English
Category
Library
โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Table of Contents

Front Matter....Pages I-XIX
Basic Graph Theory....Pages 1-32
Algorithms and Complexity....Pages 33-58
Shortest Paths....Pages 59-95
Spanning Trees....Pages 97-125
The Greedy Algorithm....Pages 127-151
Flows....Pages 153-208
Combinatorial Applications....Pages 209-237
Connectivity and Depth First Search....Pages 239-260
Colorings....Pages 261-278
Circulations....Pages 279-341
The Network Simplex Algorithm....Pages 343-361
Synthesis of Networks....Pages 363-386
Matchings....Pages 387-417
Weighted matchings....Pages 419-456
A Hard Problem: The TSP....Pages 457-500
Back Matter....Pages 501-650

โœฆ Subjects

Mathematics of Computing

๐Ÿ“œ SIMILAR VOLUMES

Graphs, Networks and Algorithms
๐Ÿ“ Graphs, Networks and Algorithms
โœ Dieter Jungnickel ๐Ÿ“‚ Library ๐Ÿ“… 2012 ๐Ÿ› Springer ๐ŸŒ English

From the 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 inte

Graphs, Networks and Algorithms
๐Ÿ“ Graphs, Networks and Algorithms
โœ Dieter Jungnickel (auth.) ๐Ÿ“‚ Library ๐Ÿ“… 2005 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ English

<P>From the reviews of the first edition:</P><P>".... 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

Graphs, Networks and Algorithms
๐Ÿ“ Graphs, Networks and Algorithms
โœ Jungnickel, Dieter ๐Ÿ“‚ Library ๐Ÿ“… 2013 ๐Ÿ› Springer ๐ŸŒ English

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 te