Distributed graph algorithms for computer networks

DOI10.1007/978-1-4471-5173-9MaRDI QIDQ355058zbMATH OpenOpenAlexFDO

Authors Kayhan Erciyes

Publication date 23 July 2013

Published in Computer Communications and Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4471-5173-9

zbMATH Keywords

distributed systemsdominating setsfault tolerant clusteringgraph algorithmsmobile ad hoc networksroutingself-stabilizationspanning treesvertex coverwireless sensor networks

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Network design and communication in computer systems (68M10) Distributed systems (68M14) Distributed algorithms (68W15)

Review text

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.

Recommendations

• Distributed algorithms. An intuitive approach
• scientific article; zbMATH DE number 53191
• Algorithmische Graphentheorie
• Distributed graph algorithms and their complexity: an introduction
• Design and Analysis of Distributed Algorithms

Cited in

(3)

• Distributed algorithms. An intuitive approach
• Distributed computing of efficient routing schemes in generalized chordal graphs
• Distributed graph algorithms and their complexity: an introduction

This page was built for publication: Distributed graph algorithms for computer networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q355058)