You might also like

More about Distributed Graph Algorithms for Computer Networks

• Book details
• Synopsis
• Trending among others

You get 241 loyalty points

Book 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.

Book details

Book category Books in English Computing & information technology Computer science Mathematical theory of computation

• Full title: Distributed Graph Algorithms for Computer Networks
• Author: Kayhan Erciyes
• Language: English
• Binding: Hardback
• Number of pages: 324
• EAN: 9781447151722
• ISBN: 1447151720
• ID: 01426233
• Publisher: Springer London Ltd
• Weight: 700 g
• Dimensions: 242 × 164 × 26 mm
• Date of publishing: 16. May 2013

Trending among others

---

---

---