Distributed Graph Algorithms for Computer Networks - Kayhan Erciyes
-25% su kodu BOOKS
Pristatymas per 17-23 d.d.
30 dienų grąžinimo politika
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 app ... Visas aprašymas
Jums taip pat gali patikti
Aprašymas
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.
Daugiau informacijos
| Autorius | Kayhan Erciyes |
|---|---|
| Leidėjas | Springer London |
| Series | Computer Communications and Networks |
| Išleidimo metai | 2013 |
| Viršelio tipas | Kieti viršeliai |
| EAN | 9781447151722 |