Abstract
This chapter discusses a selection of advanced graph algorithms. Section 12.1 presents an algorithm for finding the strongly connected components of a graph. After this, we will learn how to efficiently solve the 2SAT problem using the algorithm.
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
Notes
- 1.
This elegant algorithm is not very well known; a detailed description can be found in a textbook by Ahuja et al. [1].
- 2.
If there is an edge from a to b and also an edge from b to a, we have to add a reverse edge for both of the edges. Thus, we cannot combine edges like in the maximum flow problem, because the edges have costs which must be taken into account.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Laaksonen, A. (2020). Advanced Graph Algorithms. In: Guide to Competitive Programming. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-030-39357-1_12
Download citation
DOI: https://doi.org/10.1007/978-3-030-39357-1_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-39356-4
Online ISBN: 978-3-030-39357-1
eBook Packages: Computer ScienceComputer Science (R0)