graph-algorithm/maximum-matching

Issues

• Dependency Dashboard

  #80 opened 4 years ago by renovate
  0

• Action Required: Fix Renovate Configuration

  #27 opened 5 years ago by renovate
  0

• Split blossom implementation into understandable independent pieces

  #5 opened 5 years ago by make-github-pseudonymous-again
  0

• Implement more efficient maximum cardinality matching algorithms

  #4 opened 5 years ago by make-github-pseudonymous-again
  0

• Implement more efficient bipartite maximum matching algorithms

  #3 opened 5 years ago by make-github-pseudonymous-again
  0

• Implement linear-time approximation algorithm by Duan and Pettie

  #2 opened 5 years ago by make-github-pseudonymous-again
  0

• Implement O(n^4) algorithm

  #1 opened 5 years ago by make-github-pseudonymous-again
  0