Graph theory for car-pool problem
-
Updated
Feb 20, 2018 - Python
Graph theory for car-pool problem
A command line tool and Python library for converting lists of strings into matching regular expressions (finite automata).
Diff Match Patch is a high-performance library in multiple languages that manipulates plain text.
Source code for the paper "An MCMC based course to teaching assistant allocation".
This is a python package based on the source code for "An MCMC Based Course to Teaching Assistant Allocation", S. Kumar, S. Moothedath, P. Chaporkar, M. Belur, Proceedings of the Fifth International Conference on Network, Communication and Computing (2016). ACM.
An implementation of the blossom algorithm for constructing maximum matchings on graphs.
[ICPR2020] Solving graph matching using principle eigenvector
The Stable Matching or the Stable Marriage algorithm is a mathematical algorithm that finds stable matches between two equally sized sets of elements, the proposers and the acceptors. This project uses basic Python data structures to implement the algorithm.
A Python implementation of Edmond's blossom algorithm to find maximum matchings in general graphs
Repository of ML models and algorithm built for the EMBL publication project
This repository implements skeleton matching algorithm.
Have you ever wondered how sites like OkCupid.com and Match.com provide matches to you? How about how Amazon.com provides suggested products? How about Facebook that suggest the person you may know?
This program generates a playlist in a sequence that allows a continuous and uninterrupted listening experience. The goal of this algorithm is to minimize the weight difference between each pair of adjacent tracks in the sequence using Christofides algorithm, an approximate algorithm for solving traveling salesman problem
Order matching system for a simple mock exchange
ROR prototype developed during the FREYA project
A script used to generate the spectral correspondence figure in my DPhil thesis.
A matching algorithm for connecting students based on immediate needs, created using basic python packages and object oriented programming methods
In October 2022 we took part in the MINTvernetzt Hackathon - Mapping and Matching. In our project, we created an Angular site showing how interesting projects might be presented to the user. On top of that, we also created a Python prototype of what the algorithm for matching those projects might look like and what it would need to consider.
Add a description, image, and links to the matching-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the matching-algorithm topic, visit your repo's landing page and select "manage topics."