Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Draft: Add Maximum matching algorithm in experimental #254

Draft
wants to merge 60 commits into
base: v1.2
Choose a base branch
from

Conversation

kchristin22
Copy link

This PR introduces the Maximum Matching algorithm as presented in the paper: Distributed-Memory Algorithms for Maximum Cardinality Matching in Bipartite Graphs, using GraphBLAS operations.

TODO:

  • add push-pull optimization
  • convert to uint32 when the data set is small enough
  • create a separate vanilla version or add pragma to differentiate the function calls based on the GraphBLAS implementation used

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants