Abstract
We review basic algorithm structure and provide a brief and dense review of the main principles of sequential algorithm design and analysis with focus on graph algorithms. We then provide a short survey of NP-completeness with example NP-hard graph problems. Finally, we briefly review the major algorithm design methods showing their implementations for graph problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Cormen TH, Stein C, Rivest RL, Leiserson CE (2009) Introduction to algorithms, 3rd edn. MIT Press, Cambridge ISBN-13: 978-0262033848
Dasgupta S, Papadimitriou CH, Vazirani UV (2006) Algorithms. McGraw-Hill, New York
Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP completeness. W.H Freeman, New York
Karger D (1993) Global min-cuts in RNC and other ramifications of a simple mincut algorithm. In: Proceedings of the 4th annual ACM-SIAM symposium on discrete algorithms
Kleinberg J, Tardos E (2005) Algorithm design, 1st edn. Pearson, London ISBN-13: 978-032129535
Skiena S (2008) The algorithm design manual. Springer, Berlin ISBN-10: 1849967202
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). Graph Algorithms. In: Guide to Graph Algorithms. Texts in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-73235-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-73235-0_3
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)