menu
{ "item_title" : "Distributed Graph Algorithms for Computer Networks", "item_author" : [" Kayhan Erciyes "], "item_description" : "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.", "item_img_path" : "https://covers2.booksamillion.com/covers/bam/1/44/715/850/1447158504_b.jpg", "price_data" : { "retail_price" : "64.99", "online_price" : "64.99", "our_price" : "64.99", "club_price" : "64.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Distributed Graph Algorithms for Computer Networks|Kayhan Erciyes

Distributed Graph Algorithms for Computer Networks

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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.

This item is Non-Returnable

Details

  • ISBN-13: 9781447158509
  • ISBN-10: 1447158504
  • Publisher: Springer
  • Publish Date: June 2015
  • Dimensions: 9.21 x 6.14 x 0.72 inches
  • Shipping Weight: 1.06 pounds
  • Page Count: 324

Related Categories

You May Also Like...

    1

BAM Customer Reviews