"Music Plagiarism Detection via Bipartite Graph Matching"
-
Updated
Dec 1, 2021 - Python
#
bipartite-matching
Here are 26 public repositories matching this topic...
[ICML 2023] Learning for Edge-Weighted Online Bipartite Matching with Robustness Guarantees
-
Updated
Aug 9, 2023 - Python
rearrange the pixels of one image to create another image; not your usual image morph app
cli jupyter-notebook python-script cli-app image-morphing command-line-interface image-merge pixel-manupulation pixel-match bipartite-matching image-merger image-morphing-animations
-
Updated
Jan 30, 2021 - Jupyter Notebook
Algorithm design course in my forth semester of university
algorithms graph-algorithms clustering pattern-matching linear-programming minimum-spanning-trees sat simplex-algorithm string-matching burrows-wheeler-transform lcp-array suffix-tree suffix-array push-relabel edmonds-karp-algorithm shortest-path-algorithm bipartite-matching
-
Updated
Oct 7, 2022 - C#
All algorithms and datastructures from Introduction to Algorithms (CLRS) in C
huffman karatsuba network-flow generic edit-distance fast-fourier-transform red-black-tree dijkstra hashtable clrs kruskal prim fibonacci-heap union-find strassen fulkerson push-relabel kuhn-munkres bipartite-matching void-pointers
-
Updated
Oct 8, 2025 - C
This is the official implementation of the bipartite matching experiment from the paper "Learning Randomly Perturbed Structured Predictors for Direct Loss Minimization".
-
Updated
Apr 3, 2023 - Python
minimum bipartite matching via Riemann optimization
-
Updated
Jan 6, 2025 - Python
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.
-
Updated
Jun 11, 2020 - Python
Python implementation of algorithms for maximum cardinality matching and maximum cost assignment in bipartite graphs
assignment-problem maximum-cardinality-matching primal-dual-algorithm bipartite-matching maximum-cost-matching
-
Updated
Jul 25, 2019 - Python
End-to-End Python implementation of STRAPSim: a novel portfolio similarity metric from Li et al. (2025). Combines Random Forest proximity learning with residual-aware bipartite matching to quantify economic substitutability between ETF baskets. Full replication pipeline included.
python machine-learning random-forest scikit-learn jupyter-notebook pandas statistical-analysis supervised-learning portfolio-optimization quantitative-finance numba fixed-income asset-management proximity-matrix bipartite-matching similarity-metrics research-replication portfolio-similarity etf-analysis corporate-bonds
-
Updated
Oct 2, 2025 - Jupyter Notebook
Switch Simulator for Our QPS Paper
-
Updated
Jun 16, 2020 - C
An algorithm to find maximum cardinality matching of bipartite graph
-
Updated
Feb 9, 2021 - TypeScript
Min Cost Perfect Bipartite Matching Algorithm
-
Updated
Dec 24, 2020 - Java
A repo for notes from DAA-535-IIT
matching minimum-spanning-trees bipartite-graphs bipartite-matching graphs-algorithms max-flow-min-cost
-
Updated
Aug 6, 2024
This is a repository, containing several types of most used computer science algorithms
networking algorithms graph-algorithms data-structures binary-search-tree breadth-first-search depth-first-search dijkstra-algorithm kruskal-algorithm prims-algorithm algorithms-and-data-structures bellman-ford-algorithm ford-fulkerson-algorithm bipartite-matching
-
Updated
Jun 5, 2022
Algorithms and Data Structures for Data Science and Machine Learning (Algorithms and Data Structures Simplified) Part 2
dft sorting-algorithms convolution fft kruskal maxflow minimum-spanning-tree bipartite-testing edmonds-karp-algorithm prims bipartite-matching
-
Updated
May 30, 2021 - Jupyter Notebook
Custom implementation of some algorithms in C++
algorithm math graph string mst fft combinatorics numerical-methods number-theory max-flow bipartite-graphs bipartite-matching
-
Updated
Jul 15, 2025 - C++
Construction Heuristics, Local Search, VND, GRASP, GVNS, GA and ACO applied to the Minimum Wieghted Crossings with Constraints Problem (MWCCP)
genetic-algorithm local-search ant-colony-optimization aco heuristics metaheuristics grasp variable-neighbourhood-descent bipartite-matching gvns
-
Updated
Jan 22, 2025 - Jupyter Notebook
Animation of the Gale Shapley Algorithm that solves the matching problem of bipartite graphs.
-
Updated
May 10, 2024 - Python
Assignments done as part of the course Design & Analysis of algorithms at BITS Pilani, Hyderabad Campus.
-
Updated
Oct 28, 2021 - C++
Improve this page
Add a description, image, and links to the bipartite-matching topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the bipartite-matching topic, visit your repo's landing page and select "manage topics."