CS Colloquium - Efficient Parallel Algorithms for Large-scale Graphs

CS Colloquium - Efficient Parallel Algorithms for Large-scale Graphs promotional image


Nairen Cao


In today's big data era, processing large-scale graphs, especially those with millions of nodes, presents formidable challenges. Traditional sequential algorithms often fall short in efficiency, making the shift toward parallel or distributed algorithms essential. My research contributes to this field by developing efficient parallel algorithms that address these challenges. In this talk, I will highlight two major areas of my work:

  1. Single-source Shortest Path (SSSP): Exploring our approach to the SSSP problem in large graphs, including both approximate and exact solutions across various conditions.
  2. Correlation Clustering: Presenting a highly efficient parallel algorithm for Correlation Clustering, achieving notable approximation ratios while maintaining reasonable computational work and depth.


Nairen Cao is a Postdoctoral Researcher at Boston College, focusing on developing efficient (usually parallel) algorithms for graph problems. He earned his PhD from Georgetown University in August 2022 and has been nominated for Outstanding Papers at the ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) in 2022 and 2023.

Monday, April 1, 2024 3:30pm to 4:30pm
MacLean Hall
2 West Washington Street, Iowa City, IA 52240
View on Event Calendar
Individuals with disabilities are encouraged to attend all University of Iowa–sponsored events. If you are a person with a disability who requires a reasonable accommodation in order to participate in this program, please contact Computer Science Dept. in advance at 319-335-0713 or matthieu-biger@uiowa.edu.