Epilogue

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

Abstract

We have described the fundamentals of sequential, parallel, and distributed graph algorithms in Part I. We then reviewed basic graph algorithms which may be used as building blocks to solve more complicated problems related to graphs in Part II which formed the core of the book. We looked at sequential, parallel, and distributed algorithmic solutions to the problems studied in this part. In the final part, we first briefly reviewed algebraic and dynamic graph algorithms. Then, our emphasis was on large graphs that represent real-life large networks commonly called complex networks. Graph algorithms for such large networks required new analysis approaches and efficient algorithms as we noted.

References

  1. 1.
    Banerjee S, Khuller S (2000) A clustering scheme for hierarchical routing in wireless networks. Technical report CS-TR-4103, University of Maryland, College ParkGoogle Scholar
  2. 2.
    Erciyes K (2013) Distributed graph algorithms for computer networks. Computer communications and networks series. Springer, Berlin, pp 247–248. ISBN 978-1-4471-5172-2CrossRefGoogle Scholar
  3. 3.
    Erciyes K, Ozsoyeller D, Dagdeviren O (2008) Distributed algorithms to form cluster based spanning trees in wireless sensor networks. ICCS 2008. LNCS. Springer, Berlin, pp 519–528CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.International Computer InstituteEge UniversityIzmirTurkey

Personalised recommendations