A solver for 'College Admission Problem with Consent' based on paper 'Legal Assignments and fast EADAM with consent via classical theory of stable matchings'.
-
Updated
Mar 16, 2019 - C++
A solver for 'College Admission Problem with Consent' based on paper 'Legal Assignments and fast EADAM with consent via classical theory of stable matchings'.
Solutions to algorithmic programming problems.
This is a Stable matching program that will take N men and N women and match them using the Gale–Shapley algorithm. This program runs in O(n^2) time.
This repository contains a C++ implementation of the Stable Matching Algorithm which solves the Stable Matching Problem (known as the Stable Marriage Problem).
An implementation of stable marriage problem in C++.
hey these are some college and senior secodary projects . hope you like it
2020 Forif Winter Hackathon - Irving's Algorithm for Stable Marrige Problem (in C++)
SAT implementation of stable matching problem with couples and reference implementations of deferred acceptance algorithms.
A cli tool for solving bipartite assignment problems.
Add a description, image, and links to the stable-marriage-problem topic page so that developers can more easily learn about it.
To associate your repository with the stable-marriage-problem topic, visit your repo's landing page and select "manage topics."