Distributed Graph Algorithms for Computer Networks

✍ Scribed by Kayhan Erciyes

Publisher: Springer
Year: 2013
Tongue: English
Leaves: 328
Category: Library

No coin nor oath required. For personal study only.

✦ Synopsis

This hands-on textbook/reference presents a comprehensive review of key distributed graph algorithms for computer network applications, with a particular emphasis on practical implementation. Each chapter opens with a concise introduction to a specific problem, supporting the theory with numerous examples, before providing a list of relevant algorithms. These algorithms are described in detail from conceptual basis to pseudocode, complete with graph templates for the stepwise implementation of the algorithm, followed by its analysis.

📜 SIMILAR VOLUMES

Distributed Graph Algorithms for Compute

📁 Distributed Graph Algorithms for Computer Networks

✍ K. Erciyes (auth.) 📂 Library 📅 2013 🏛 Springer-Verlag London 🌐 English

<p>This book presents a comprehensive review of key distributed graph algorithms for computer network applications, with a particular emphasis on practical implementation. Topics and features: introduces a range of fundamental graph algorithms, covering spanning trees, graph traversal algorithms, ro

Distributed graph algorithms for compute

📁 Distributed graph algorithms for computer networks

✍ Erciyes K. 📂 Library 📅 2013 🏛 Springer 🌐 English

Graph theory is an invaluable tool for the designer of algorithms for distributed systems. This hands-on textbook/reference presents a comprehensive review of key distributed graph algorithms for computer network applications, with a particular emphasis on practical implementation. Each chapter open

Distributed Graph Algorithms for Compute

📁 Distributed Graph Algorithms for Computer Networks

✍ Erciyes, K 📂 Library 📅 2013 🏛 Imprint, Springer, Springer London 🌐 English

Distributed Graph Algorithms for Compute

📁 Distributed Graph Algorithms for Computer Networks

✍ Erciyes, K 📂 Library 📅 2013 🏛 Imprint, Springer, Springer London 🌐 English

Introduction -- Part I: Fundamental Algorithms -- Graphs -- The Computational Model -- Spanning Tree Construction -- Graph Traversals -- Minimal Spanning Trees -- Routing -- Self-Stabilization -- Part II: Graph Theoretical Algorithms -- Vertex Coloring -- Maximal Independent Sets -- Dominating Sets

Graphs, Networks and Algorithms (Algorit

📁 Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics)

✍ Dieter Jungnickel 📂 Library 📅 2007 🏛 Springer 🌐 English

This is the definitive guide to graph algorithms. Every algorithm is well documented with proofs and complexity estimates. A general knowledge of graph theory is presupposed. This is a very good thing, since then neither paper or time needs to be vasted on elementaries. There are heaps of introd

Graphs, Networks and Algorithms (Algorit

📁 Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics)

✍ Dieter Jungnickel 📂 Library 📅 2007 🏛 Springer 🌐 English