Optimal Selection of Training Courses for Unemployed People based on Stable Marriage Model
This repository contains a Python implementation of the Stable Marriage Algorithm, a mechanism for solving the stable marriage problem. The algorithm is widely used in the field of matching theory to find a stable matching between two sets of elements, such as job applicants and employers or medical students and residency programs.
Refined the Gale-Shapley algorithm by recalculating stable matchings in bipartite graphs, incorporating dynamic updates for edge deletions, achieving O(N) time complexity for edge deletions, enhancing computational efficiency.
Stable matching algorithm from "College Admissions and the Stability of Marriage" paper by Gale, D.; Shapley, L. S. (1962)
The Process of College Selection Using Stable Matching Algorithm
This repo contains the core foundational algos and data structures
Rust implementation of a modified stable matching problem.
Stable Big-Little Matching
Add a description, image, and links to the stable-matching-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the stable-matching-algorithm topic, visit your repo's landing page and select "manage topics."