Skip to content

implementing the Blossom algorithm for maximum weight matchingΒ #14

@Krastanov

Description

@Krastanov

Edit: The bounty is removed as the urgency to fix this is gone now that we have working MWPM on all platforms thanks to LEMONGraphs.jl. Leaving this up as a feature request.

Implement the well-known Blossom algorithm for maximum weight (perfect) matching in generic graphs.

Two bounties are available here:

  • a 500$ bounty for implementing a pure-julia Blossom with tests and documentation, making it the default here, and moving BlossomV.jl from a dependency to a weak dependency (so that it is not necessary during installation)
  • a 500$ bounty on improving the performance of the new implementation to no-worse than 90% of BlossomV.jl

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions