Distributed Graph Algorithms for Computer Networks

Focusing on distributed graph algorithms, this book offers a thorough exploration of their applications in computer networks. It covers essential topics such as spanning trees, graph traversal, and routing algorithms, emphasizing practical implementation with numerous examples. The text delves into distributed approximation algorithms for ad hoc wireless networks and discusses concepts like dominating sets and node mobility. Additionally, it includes a simulator for running distributed algorithms and practical exercises at the end of each chapter to reinforce learning.