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

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Erciyes, Kayhan (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: London : Springer London : Imprint: Springer, 2013.
Edición:1st ed. 2013.
Colección:Computer Communications and Networks,
Temas:
Algorithms.
Computer networks .
Computer science-Mathematics.
Computer Communication Networks.
Mathematical Applications in Computer Science.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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.

Ejemplares similares