Skip to content

Finding the Strongly Connected Components (SCCs) of a directed graph on shared-memory multiprocessor.

Notifications You must be signed in to change notification settings

AndreadisStel/SCC-Coloring-Algorithm-Parallel

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

15 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

SCC-Coloring Algorithm (Parallel)

Parallel implementation of a graph coloring algorithm using pthreads, OpenMP, and Cilk.

Focus on performance comparison and scalability across different parallel programming models.

Based on the SCC coloring approach and developed as part of a parallel computing course.

About

Finding the Strongly Connected Components (SCCs) of a directed graph on shared-memory multiprocessor.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages