Skip to main content
SpringerLink
Log in

Guide to Graph Algorithms

Sequential, Parallel and Distributed

  • Textbook
  • © 2018

Overview

Authors:
  1. K Erciyes

    1. International Computer Institute, Ege University, Izmir, Turkey

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • Presents detailed coverage of sequential graph algorithms, together with some sample parallel and distributed graph algorithm design methods
  • Provides a comparative analysis of the three methods of sequential, parallel and distributed graph algorithms
  • Describes techniques for conversion between the different methods

Part of the book series: Texts in Computer Science (TCS)

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 84.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 (15 chapters)

  1. Front Matter

    Pages i-xviii
    Download chapter PDF

  2. Introduction

    • K. Erciyes
    Pages 1-11

  3. Fundamentals

    1. Front Matter

      Pages 13-13
      Download chapter PDF

    2. Introduction to Graphs

      • K. Erciyes
      Pages 15-35

    3. Graph Algorithms

      • K. Erciyes
      Pages 37-76

    4. Parallel Graph Algorithms

      • K. Erciyes
      Pages 77-115

    5. Distributed Graph Algorithms

      • K. Erciyes
      Pages 117-136

  4. Basic Graph Algorithms

    1. Front Matter

      Pages 137-137
      Download chapter PDF

    2. Trees and Graph Traversals

      • K. Erciyes
      Pages 139-175

    3. Weighted Graphs

      • K. Erciyes
      Pages 177-219

    4. Connectivity

      • K. Erciyes
      Pages 221-262

    5. Matching

      • K. Erciyes
      Pages 263-303

    6. Independence, Domination, and Vertex Cover

      • K. Erciyes
      Pages 305-336

    7. Coloring

      • K. Erciyes
      Pages 337-365

  5. Advanced Topics

    1. Front Matter

      Pages 367-367
      Download chapter PDF

    2. Algebraic and Dynamic Graph Algorithms

      • K. Erciyes
      Pages 369-393

    3. Analysis of Large Graphs

      • K. Erciyes
      Pages 395-416

    4. Complex Networks

      • K. Erciyes
      Pages 417-442

    5. Epilogue

      • K. Erciyes
      Pages 443-451

  6. Back Matter

    Pages 453-471
    Download chapter PDF
Back to top

Keywords

About this book

This clearly structured textbook/reference presents a detailed and comprehensive review of the fundamental principles of sequential graph algorithms, approaches for NP-hard graph problems, and approximation algorithms and heuristics for such problems. The work also provides a comparative analysis of sequential, parallel and distributed graph algorithms – including algorithms for big data – and an investigation into the conversion principles between the three algorithmic methods.

Topics and features: presents a comprehensive analysis of sequential graph algorithms; offers a unifying view by examining the same graph problem from each of the three paradigms of sequential, parallel and distributed algorithms; describes methods for the conversion between sequential, parallel and distributed graph algorithms; surveys methods for the analysis of large graphs and complex network applications; includes full implementation details for the problems presented throughout the text; provides additional supporting material at an accompanying website.

This practical guide to the design and analysis of graph algorithms is ideal for advanced and graduate students of computer science, electrical and electronic engineering, and bioinformatics. The material covered will also be of value to any researcher familiar with the basics of discrete mathematics, graph theory and algorithms.

Reviews

“This volume would serve well as an introduction to graph algorithms for self-study by someone already familiar with graph theory, parallel computing, and distributed computing. It could prove useful to a researcher looking for a specific algorithm on, say, finding MSTs.” (Lenwood S. Heath, Mathematical Reviews, August, 2019)

Authors and Affiliations

  • International Computer Institute, Ege University, Izmir, Turkey

    K Erciyes

About the author

Dr. K. Erciyes is an Emeritus Professor of Computer Engineering at Ege University, Turkey. His other publications include the Springer titles Distributed Graph Algorithms for Computer Networks and Distributed and Sequential Algorithms for Bioinformatics.

Bibliographic Information

  • Book Title: Guide to Graph Algorithms

  • Book Subtitle: Sequential, Parallel and Distributed

  • Authors: K Erciyes

  • Series Title: Texts in Computer Science

  • DOI: https://doi.org/10.1007/978-3-319-73235-0

  • Publisher: Springer Cham

  • eBook Packages: Computer Science, Computer Science (R0)

  • Copyright Information: Springer International Publishing AG, part of Springer Nature 2018

  • Hardcover ISBN: 978-3-319-73234-3Published: 23 April 2018

  • Softcover ISBN: 978-3-030-10338-5Published: 01 February 2019

  • eBook ISBN: 978-3-319-73235-0Published: 13 April 2018

  • Series ISSN: 1868-0941

  • Series E-ISSN: 1868-095X

  • Edition Number: 1

  • Number of Pages: XVIII, 471

  • Number of Illustrations: 246 b/w illustrations, 1 illustrations in colour

  • Topics: Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science

Publish with us

Policies and ethics

Back to top

Search

Navigation