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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Banerjee S, Khuller S (2000) A clustering scheme for hierarchical routing in wireless networks. Technical report CS-TR-4103, University of Maryland, College Park
Erciyes K (2013) Distributed graph algorithms for computer networks. Computer communications and networks series. Springer, Berlin, pp 247–248. ISBN 978-1-4471-5172-2
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–528
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Erciyes, K. (2018). Epilogue. In: Guide to Graph Algorithms. Texts in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-73235-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-73235-0_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-73234-3
Online ISBN: 978-3-319-73235-0
eBook Packages: Computer ScienceComputer Science (R0)