Distributed Graph Algorithms for Computer Networks

Distributed Graph Algorithms for Computer Networks

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 open...

Full description

Bibliographic Details
Published in:Springer eBooks
Main Author: Erciyes, K. (Author)
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: London : Springer London : Imprint: Springer, 2013.
Series:Computer Communications and Networks,
Subjects:
Computer Science.
Computer Communication Networks.
Computer software.
Algorithm Analysis and Problem Complexity.
Math Applications in Computer Science.
Online Access:http://dx.doi.org/10.1007/978-1-4471-5173-9
Перейти в каталог НБ ТГУ
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.

Similar Items