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

Graphs, Networks and Algorithms

โœ Scribed by Dieter Jungnickel (auth.)

Publisher
Springer Berlin Heidelberg
Year
1999
Tongue
English
Leaves
597
Series
Algorithms and Computation in Mathematics 5
Category
Library
โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Table of Contents

Front Matter....Pages I-XII
Basic Graph Theory....Pages 1-33
Algorithms and Complexity....Pages 35-62
Shortest Paths....Pages 63-98
Spanning Trees....Pages 99-127
The Greedy Algorithm....Pages 129-153
Flows....Pages 155-208
Applications in Combinatorics....Pages 209-237
Colourings....Pages 239-252
Circulations....Pages 253-304
Synthesis of Networks....Pages 305-330
Connectivity....Pages 331-353
Matchings....Pages 355-388
Weighted Matchings....Pages 389-422
A Hard Problem: The TSP....Pages 423-469
Solutions....Pages 471-542
List of Symbols....Pages 543-549
Back Matter....Pages 551-595

โœฆ Subjects

Combinatorics

๐Ÿ“œ 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