/dynamic-matching

Extension of work in 6.886 (patins/perfect-match) focusing on dynamic greedy algorithms to solve b-matching

Primary LanguageC++

6.886 Weighted b-Matching

Structure

  • bSuitorIntel - bSuitor code from Pothen's paper
  • data - matrix files used to test and benchmark
  • utils - our utilities, including a graph generator
  • lock_free - lockless implementation of bSuitor
  • greedy - greedy implementation (within this is the dynamic greedy code)
  • mip - Gurobi code for optimal solution