| 书目名称 | Distributed Graph Algorithms for Computer Networks |
| 编辑 | K. Erciyes |
| 视频video | |
| 概述 | Presents a comprehensive review of key distributed graph algorithms for computer network applications.Describes in detail the implementation of each algorithm, and discusses their concrete network app |
| 丛书名称 | Computer Communications and Networks |
| 图书封面 |  |
| 描述 | 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. |
| 出版日期 | Textbook 2013 |
| 关键词 | Ad Hoc Networks; Distributed Algorithm; Graph Algorithm; Network Algorithm; Sensor Networks; algorithm an |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-1-4471-5173-9 |
| isbn_softcover | 978-1-4471-5850-9 |
| isbn_ebook | 978-1-4471-5173-9Series ISSN 1617-7975 Series E-ISSN 2197-8433 |
| issn_series | 1617-7975 |
| copyright | Springer-Verlag London 2013 |
发表于 2025-3-21 19:47:17
