Distributed Graph Algorithms for Computer Networks (Hardcover, 2013 ed.)

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.

General

Imprint:	Springer London
Country of origin:	United Kingdom
Series:	Computer Communications and Networks
Release date:	June 2013
First published:	2013
Authors:	Kayhan Erciyes
Dimensions:	235 x 155 x 26mm (L x W x T)
Format:	Hardcover
Pages:	324
Edition:	2013 ed.
ISBN-13:	978-1-4471-5172-2
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Books > Science & Mathematics > Mathematics > Applied mathematics > Mathematics for scientists & engineers Promotions
LSN:	1-4471-5172-0
Barcode:	9781447151722

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!