Skip to main content
SpringerLink
Log in

Distributed Graph Algorithms for Computer Networks

  • Textbook
  • © 2013

Overview

Authors:
  1. K. Erciyes

    1. Computer Engineering Department, Izmir University, Uckuyular, Izmir, Turkey

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • Presents a comprehensive review of key distributed graph algorithms for computer network applications
  • Describes in detail the implementation of each algorithm, and discusses their concrete network applications
  • Includes practical exercises at the end of each chapter, and a simple simulator developed to run distributed algorithms
  • Includes supplementary material: sn.pub/extras

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

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 99.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (18 chapters)

  1. Front Matter

    Pages I-XVIII
    Download chapter PDF

  2. Introduction

    • K. Erciyes
    Pages 1-8

  3. Fundamental Algorithms

    1. Front Matter

      Pages 9-9
      Download chapter PDF

    2. Graphs

      • K. Erciyes
      Pages 11-21

    3. The Computational Model

      • K. Erciyes
      Pages 23-37

    4. Spanning Tree Construction

      • K. Erciyes
      Pages 39-51

    5. Graph Traversals

      • K. Erciyes
      Pages 53-67

    6. Minimum Spanning Trees

      • K. Erciyes
      Pages 69-82

    7. Routing

      • K. Erciyes
      Pages 83-96

    8. Self-Stabilization

      • K. Erciyes
      Pages 97-104

  4. Graph Theoretical Algorithms

    1. Front Matter

      Pages 105-105
      Download chapter PDF

    2. Vertex Coloring

      • K. Erciyes
      Pages 107-134

    3. Maximal Independent Sets

      • K. Erciyes
      Pages 135-155

    4. Dominating Sets

      • K. Erciyes
      Pages 157-171

    5. Matching

      • K. Erciyes
      Pages 173-191

    6. Vertex Cover

      • K. Erciyes
      Pages 193-213

  5. Ad Hoc Wireless Networks

    1. Front Matter

      Pages 215-215
      Download chapter PDF

    2. Introduction

      • K. Erciyes
      Pages 217-228

    3. Topology Control

      • K. Erciyes
      Pages 229-257

    4. Ad Hoc Routing

      • K. Erciyes
      Pages 259-275
Back to top

Keywords

About this book

This book presents a comprehensive review of key distributed graph algorithms for computer network applications, with a particular emphasis on practical implementation. 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.

Reviews

From the reviews:

“This beautiful and timely book provides a comprehensive review of key distributed graph algorithms for computer network applications. … a must-read for young students and researchers who want to master the topics and implement applications. This would be an excellent textbook for courses on distributed systems. … I highly recommend it to researchers and students of computer networks, and it will also provide a solid foundation for many upcoming areas of research, such as network coding for distributed storage systems.” (Manish Gupta, Computing Reviews, February, 2014)

Authors and Affiliations

  • Computer Engineering Department, Izmir University, Uckuyular, Izmir, Turkey

    K. Erciyes

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation