コンテンツへ移動
Distributed graph algorithms for computer networks 資料のプレビュー
閉じる資料のプレビュー
確認中…

Distributed graph algorithms for computer networks

著者: K Erciyes
出版: London ; New York : Springer, ©2013.
シリーズ: Computer communications and networks.
エディション/フォーマット:   電子書籍 : Document : Englishすべてのエディションとフォーマットを見る
データベース:WorldCat
概要:
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 opens with a concise introduction to a specific problem, supporting the theory with numerous examples, before providing a  続きを読む
評価:

(まだ評価がありません) 0 件のレビュー - 是非あなたから!

件名:
関連情報:

 

オンラインで入手

この資料へのリンク

オフラインで入手

&AllPage.SpinnerRetrieving; この資料の所蔵館を検索中…

詳細

ジャンル/形式: Electronic books
その他のフォーマット: Original print version: Erciyes, K.
Distributed graph algorithms for computer networks.
London : Springer, [2013]
(OCoLC)830945897
資料の種類: Document, インターネット資料
ドキュメントの種類: インターネットリソース, コンピューターファイル
すべての著者/寄与者: K Erciyes
ISBN: 9781447151739 1447151739
OCLC No.: 844952121
物理形態: 1 online resource (xviii, 324 pages) : illustrations
コンテンツ: Fundamental Algorithms. Graphs --
The Computational Model --
Spanning Tree Construction --
Graph Traversals --
Minimum Spanning Trees --
Routing --
Self-Stabilization --
Graph Theoretical Algorithms. Vertex Coloring --
Maximal Independent Sets --
Dominating Sets --
Matching --
Vertex Cover --
Ad Hoc Wireless Networks. Introduction --
Topology Control --
Ad Hoc Routing --
Sensor Network Applications --
ASSIST: A Simulator to Develop Distributed Algorithms.
シリーズタイトル: Computer communications and networks.
責任者: K. Erciyes.
その他の情報:

概要:

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 opens with a concise introduction to a specific problem, supporting the theory with numerous examples, before providing a list of relevant algorithms. These algorithms are described in detail from conceptual basis to pseudocode, complete with graph templates for the stepwise implementation of the algorithm, followed by its analysis. The chapters then conclude with summarizing notes and programming exercises. 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 This classroom-tested and easy-to-follow textbook is essential reading for all graduate students and researchers interested in discrete mathematics, algorithms and computer networks. Prof. Dr. Kayhan Erciyeş is the Rector and a member of the Computer Engineering Department at Izmir University, Turkey.

レビュー

編集者のレビュー

出版社によるあらすじ

From the reviews: "This beautiful and timely book provides a comprehensive review of key distributed graph algorithms for computer network applications. ... a must-read for young students and 続きを読む

 
ユーザーレビュー
GoodReadsのレビューを取得中…
DOGObooksのレビューを取得中…

タグ

まずはあなたから!
リクエストの確認

あなたは既にこの資料をリクエストしている可能性があります。このリクエストを続行してよろしければ、OK を選択してください。

リンクデータ


<http://www.worldcat.org/oclc/844952121>
library:oclcnum"844952121"
library:placeOfPublication
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
rdf:typeschema:MediaObject
rdf:valueUnknown value: dct
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:bookFormatschema:EBook
schema:copyrightYear"2013"
schema:creator
schema:datePublished"2013"
schema:description"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 opens with a concise introduction to a specific problem, supporting the theory with numerous examples, before providing a list of relevant algorithms. These algorithms are described in detail from conceptual basis to pseudocode, complete with graph templates for the stepwise implementation of the algorithm, followed by its analysis. The chapters then conclude with summarizing notes and programming exercises. 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 This classroom-tested and easy-to-follow textbook is essential reading for all graduate students and researchers interested in discrete mathematics, algorithms and computer networks. Prof. Dr. Kayhan Erciyeş is the Rector and a member of the Computer Engineering Department at Izmir University, Turkey."@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/1372592797>
schema:genre"Electronic books"@en
schema:inLanguage"en"
schema:isPartOf
schema:name"Distributed graph algorithms for computer networks"@en
schema:publication
schema:publisher
schema:url
schema:workExample
schema:workExample
wdrs:describedby

Content-negotiable representations

ウインドウを閉じる

WorldCatにログインしてください 

アカウントをお持ちではないですか?簡単に 無料アカウントを作成することができます。.