Distributed graph algorithms for computer networks (Q355058)

This book is about distributed graph algorithms applied to computer networks with focus on practical implementation. Each chapter of this hands-on textbook/reference opens with a concise introduction to a specific problem, supporting the theory with numerous examples, before providing a list of relevant algorithms. These algorithms are described in detail from conceptual basis to pseudocode, complete with graph templates for the stepwise implementation of the algorithm, followed by its analysis. The chapters then conclude with summarizing notes and programming exercises. Topics and features covered: {\parindent=6mm \begin{itemize}\item[-] fundamental graph algorithms, covering spanning trees, dominating sets, graph traversal algorithms, routing algorithms, self-stabilization, vertex coloring, vertex cover, and matchings; \item[-] graph-theoretical distributed approximation algorithms and parameters for mobility and energy levels of nodes with applications in ad hoc wireless networks; \item[-] a simple simulator, developed to run distributed algorithms. \end{itemize}} This classroom-tested and easy-to-follow textbook is essential reading for all graduate students and researchers interested in discrete mathematics, algorithms and computer networks.