Implemented parallel and sequencial versions of the Egervary's algorithm for finding a maximum matching in a bipartite graph. The school project for the Graph Algorithms Course (GAL).
Used: C, pthread, Python, python-igraph
Authors:
-
Notifications
You must be signed in to change notification settings - Fork 0
poncovka/parallel-egervary
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
The parallel algorithm for finding a maximum matching in a bipartite graph.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published