Distributed Graph Algorithms for Computer Networks

• Κύριος συγγραφέας: Erciyes, K. (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: London : Springer London : Imprint: Springer, 2013.
• Σειρά: Computer Communications and Networks,
• Θέματα: Computer science.; Computer communication systems.; Algorithms.; Computer science > Mathematics.; Computer Science.; Algorithm Analysis and Problem Complexity.; Computer Communication Networks.; Math Applications in Computer Science.

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

Πίνακας περιεχομένων:

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