MLPb: Matching via weight-constrained label propagation in bipartite networks
All solutions to the problems in the "Graph Theory I" study plan on LeetCode.
Coding challenges from leetcode/hackerrank with Arrays, Trees, LinkedList, Stack/Queues, Heap, Graphs (Path finding for minimum weight along with routes, Minimum Spanning Tree), and Dynamic Programming.
Simple repo that contains some useful algorithms used for MST and other graph applications. Made for the Algorithm Design and Analysis course during 2021-20
An implementation of a Disjoint-Set (Union-Find) data structure.
OPM: One-mode projection-based multilevel method for bipartite networks
by University of California San Diego & National Research University Higher School of Economics (Coursera)
Collection of programming tasks
The program finds and displays all cliques with different densities in a given bipartite graph with variable density.
ACM ICPC World Finals 2017 Problem C
Algorithm to test if a given graph is Bipartite or not
It is a command-line tool that quickly validates whether a given graph is bipartite.
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.
Project on Temporal Role Based Access Control
Useful data structures and algorithms mostly related to Graphs.
Add a description, image, and links to the bipartite-graphs topic page so that developers can more easily learn about it.
To associate your repository with the bipartite-graphs topic, visit your repo's landing page and select "manage topics."