Distributed Graph Algorithms for Computer Networks

✍ Scribed by K. Erciyes (auth.)

Publisher: Springer-Verlag London
Year: 2013
Tongue: English
Leaves: 327
Series: Computer Communications and Networks
Edition: 1
Category: Library

No coin nor oath required. For personal study only.

✦ Synopsis

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, routing algorithms, and self-stabilization; reviews graph-theoretical distributed approximation algorithms with applications in ad hoc wireless networks; describes in detail the implementation of each algorithm, with extensive use of supporting examples, and discusses their concrete network applications; examines key graph-theoretical algorithm concepts, such as dominating sets, and parameters for mobility and energy levels of nodes in wireless ad hoc networks, and provides a contemporary survey of each topic; presents a simple simulator, developed to run distributed algorithms; provides practical exercises at the end of each chapter.

✦ Table of Contents

Front Matter....Pages I-XVIII
Introduction....Pages 1-8
Front Matter....Pages 9-9
Graphs....Pages 11-21
The Computational Model....Pages 23-37
Spanning Tree Construction....Pages 39-51
Graph Traversals....Pages 53-67
Minimum Spanning Trees....Pages 69-82
Routing....Pages 83-96
Self-Stabilization....Pages 97-104
Front Matter....Pages 105-105
Vertex Coloring....Pages 107-134
Maximal Independent Sets....Pages 135-155
Dominating Sets....Pages 157-171
Matching....Pages 173-191
Vertex Cover....Pages 193-213
Front Matter....Pages 215-215
Introduction....Pages 217-228
Topology Control....Pages 229-257
Ad Hoc Routing....Pages 259-275
Sensor Network Applications....Pages 277-294
ASSIST: A Simulator to Develop Distributed Algorithms....Pages 295-303
Back Matter....Pages 305-324

✦ Subjects

Algorithm Analysis and Problem Complexity; Computer Communication Networks; Math Applications in Computer Science

📜 SIMILAR VOLUMES

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

Distributed Graph Algorithms for Compute

📁 Distributed Graph Algorithms for Computer Networks

✍ Kayhan Erciyes 📂 Library 📅 2013 🏛 Springer 🌐 English

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 ex

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