Distributed Graph Algorithms for Computer Networks

  • K. Erciyes

Part of the Computer Communications and Networks book series (CCN)

Table of contents

  1. Front Matter
    Pages I-XVIII
  2. K. Erciyes
    Pages 1-8
  3. Fundamental Algorithms

    1. Front Matter
      Pages 9-9
    2. K. Erciyes
      Pages 11-21
    3. K. Erciyes
      Pages 23-37
    4. K. Erciyes
      Pages 39-51
    5. K. Erciyes
      Pages 53-67
    6. K. Erciyes
      Pages 69-82
    7. K. Erciyes
      Pages 83-96
    8. K. Erciyes
      Pages 97-104
  4. Graph Theoretical Algorithms

    1. Front Matter
      Pages 105-105
    2. K. Erciyes
      Pages 107-134
    3. K. Erciyes
      Pages 135-155
    4. K. Erciyes
      Pages 157-171
    5. K. Erciyes
      Pages 173-191
    6. K. Erciyes
      Pages 193-213
  5. Ad Hoc Wireless Networks

    1. Front Matter
      Pages 215-215
    2. K. Erciyes
      Pages 217-228
    3. K. Erciyes
      Pages 229-257
    4. K. Erciyes
      Pages 259-275
    5. K. Erciyes
      Pages 277-294
  6. Back Matter
    Pages 305-324

About this book


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

  • Introduces a range of fundamental graph algorithms, covering spanning trees, graph traversal algorithms, routing algorithms, and self-stabilization
  • Reviews graph-theoretical distributed approximation algorithms with applications in ad hoc wireless networks
  • Describes in detail the implementation of each algorithm, with extensive use of supporting examples, and discusses their concrete network applications
  • Examines key graph-theoretical algorithm concepts, such as dominating sets, and parameters for mobility and energy levels of nodes in wireless ad hoc networks, and provides a contemporary survey of each topic
  • Presents a simple simulator, developed to run distributed algorithms
  • Provides practical exercises at the end of each chapter

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.

Prof. Dr. Kayhan Erciyeş is the Rector and a member of the Computer Engineering Department at Izmir University, Turkey



Ad Hoc Networks Distributed Algorithm Graph Algorithm Network Algorithm Sensor Networks

Authors and affiliations

  • K. Erciyes
    • 1
  1. 1.Computer Engineering DepartmentIzmir UniversityUckuyular, IzmirTurkey

Bibliographic information