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:
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: