For small inputs (log_normal_100.csv and musae_ENGB_edges.csv), it was presumed possibled to attempt an algorithm that can provide optimal matching, rather than relying on approximations. I referenced ...

Abstract: The Edmonds Blossom algorithm is implemented here using depth-first search, which is intrinsically serial. By streamlining the code, our serial implementation is consistently three to five ...

This project implements the Blossom Algorithm to compute maximum matchings in general graphs, including both bipartite and non-bipartite cases. It was developed as part of a university Graph Theory ...