Knockout Narratives Sale
 
 

Special Offers see all

Enter to WIN a $100 Credit

Subscribe to PowellsBooks.news
for a chance to win.
Privacy Policy

Visit our stores


    Recently Viewed clear list


    Original Essays | January 5, 2015

    Frances E. Jensen: IMG What You Don't Know about the Teenage Brain



    Things were changing in our household: the teen years had intruded into our otherwise harmonious, do-as-mom-tells-you relatively orderly world. As... Continue »

    spacer
Qualifying orders ship free.
$87.75
New Hardcover
Ships in 1 to 3 days
Add to Wishlist
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
Qty Store Section
25 Remote Warehouse Computers Reference- General

Other titles in the Computer Communications and Networks series:

Distributed Graph Algorithms for Computer Networks (Computer Communications and Networks)

by

Distributed Graph Algorithms for Computer Networks (Computer Communications and Networks) Cover

 

Synopses & Reviews

Publisher Comments:

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-stabilizationReviews graph-theoretical distributed approximation algorithms with applications in ad hoc wireless networksDescribes in detail the implementation of each algorithm, with extensive use of supporting examples, and discusses their concrete network applicationsExamines 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 topicPresents a simple simulator, developed to run distributed algorithmsProvides practical exercises at the end of each chapterThis 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.

Synopsis:

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.

Table of Contents

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

Product Details

ISBN:
9781447151722
Author:
Erciyes, Kayhan
Publisher:
Springer
Author:
Erciyes, K.
Location:
London
Subject:
ad-hoc networks
Subject:
distributed algorithm
Subject:
Graph Algorithm
Subject:
Network Algorithm
Subject:
Sensor networks
Subject:
Algorithm Analysis and Problem Complexity
Subject:
Computer Communication Networks
Subject:
Math Applications in Computer Science
Subject:
Computers-Reference - General
Subject:
Computer Science
Subject:
B
Subject:
Computer software
Copyright:
Edition Description:
2013
Series:
Computer Communications and Networks
Publication Date:
20130630
Binding:
HARDCOVER
Language:
English
Pages:
350
Dimensions:
235 x 155 mm

Related Subjects

Computers and Internet » Computers Reference » General
Computers and Internet » Networking » General
Computers and Internet » Networking » Hardware
Computers and Internet » Software Engineering » Algorithms

Distributed Graph Algorithms for Computer Networks (Computer Communications and Networks) New Hardcover
0 stars - 0 reviews
$87.75 In Stock
Product details 350 pages Springer - English 9781447151722 Reviews:
"Synopsis" by , 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.
spacer
spacer
  • back to top

FOLLOW US ON...

     
Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.