Manaswi-Vichare/Efficient-Stable-Matching-Recomputation-in-Dynamic-Bipartite-Graphs

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.

Jupyter Notebook