Distributed graph algorithms for computer networks

著者

• Erciyes, K.

書誌事項

Distributed graph algorithms for computer networks

K. Erciyes

（Computer communications and networks）

Springer, c2013

注記

Includes bibliographical references and index

内容説明・目次

内容説明

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.

目次

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 Matching Vertex Cover Part III: Ad Hoc Wireless Networks Introduction Topology Control Ad Hoc Routing Sensor Network Applications ASSIST: A Simulator to Develop Distributed Algorithms Pseudocode Conventions ASSIST Code Applications Using ASSIST

「Nielsen BookData」 より

詳細情報

• NII書誌ID(NCID): BB1311733X
• ISBN:
  • 9781447151722
• LCCN: 2012953098
• 出版国コード: uk
• タイトル言語コード: eng
• 本文言語コード: eng
• 出版地: London
• ページ数/冊数: xviii, 324 p.
• 大きさ: 25 cm
• 親書誌ID:
  • BA51941633