Distributed Graph Algorithms for Computer Networks

Focusing on distributed graph algorithms, this book offers an in-depth exploration tailored for computer network applications. It covers essential topics such as spanning trees, routing algorithms, and self-stabilization, while also delving into graph-theoretical distributed approximation algorithms relevant to ad hoc wireless networks. Each algorithm is thoroughly implemented with practical examples, and key concepts like dominating sets and node mobility are examined. Additionally, a simple simulator is included, along with practical exercises at the end of each chapter to reinforce learning.