Graphs, Networks and Algorithms

✍ Scribed by Dieter Jungnickel (auth.)

Publisher: Springer
Year: 2013
Tongue: English
Leaves: 676
Edition: 4
Category: Library

⬇ Acquire This Volume

No coin nor oath required. For personal study only.

✦ 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

✍ Dieter Jungnickel (auth.) 📂 Library 📅 1999 🏛 Springer Berlin Heidelberg 🌐 English

Graphs, Networks and Algorithms

📁 Graphs, Networks and Algorithms

✍ 9783540727798 📂 Library 📅 2008 🏛 Springer 🌐 English

Graphs, Networks and Algorithms

📁 Graphs, Networks and Algorithms

✍ Dieter Jungnickel (auth.) 📂 Library 📅 2008 🏛 Springer 🌐 English

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