Advertisement

Advanced Graph Algorithms

  • Antti LaaksonenEmail author
Chapter
  • 96 Downloads
Part of the Undergraduate Topics in Computer Science book series (UTICS)

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.

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of HelsinkiHelsinkiFinland

Personalised recommendations