"Music Plagiarism Detection via Bipartite Graph Matching"

[ICML 2023] Learning for Edge-Weighted Online Bipartite Matching with Robustness Guarantees

rearrange the pixels of one image to create another image; not your usual image morph app

Advanced algorithms and generic data structures in C

Algorithm design course in my forth semester of university

This is the official implementation of the bipartite matching experiment from the paper "Learning Randomly Perturbed Structured Predictors for Direct Loss Minimization".

Python implementation of an approximate Euclidean bipartite matching algorithm proposed by a 2004 paper "A Near-Linear Constant-Factor Approximation for Euclidean Bipartite Matching?" by Pankaj Agarwal and Kasturi Varadarajan.

Python implementation of algorithms for maximum cardinality matching and maximum cost assignment in bipartite graphs

Switch Simulator for Our QPS Paper

An algorithm to find maximum cardinality matching of bipartite graph

Min Cost Perfect Bipartite Matching Algorithm

minimum bipartite matching via Riemann optimization

This is a repository, containing several types of most used computer science algorithms

Algorithms and Data Structures for Data Science and Machine Learning (Algorithms and Data Structures Simplified) Part 2

Custom implementation of some algorithms in C++

A repo for notes from DAA-535-IIT

Solution to an perfect bipartite matching problem

Animation of the Gale Shapley Algorithm that solves the matching problem of bipartite graphs.

1071_圖形理論 GRAPH THEORY

the algorithm works by first finding a maximum matching in the bipartite graph, which is a set of edges that pairs as many nodes as possible without sharing any common nodes. Then, the maximum matching is converted into a vertex cover, which is a set of nodes that covers all the edges in the graph