Skip to content
#

edge-deletion

Star

Here is 1 public repository matching this topic...

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

Star 0

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.

python algorithms data-structures time-complexity stable-marriage bipartite-graphs gale-shapley-algorithm stable-matching-problem stable-matching stable-matching-algorithm edge-deletion
  • Updated Jul 3, 2024
  • Jupyter Notebook

Improve this page

Add a description, image, and links to the edge-deletion topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the edge-deletion topic, visit your repo's landing page and select "manage topics."

Learn more