This project assigns doctors to hospitals based on their preference lists by making use of the Rank-Maximal Matching algorithm, a method for assigning applicants to positions in a way that maximizes ...
Python reproduction of "A Faster Deterministic Algorithm for Fully Dynamic Maximal Matching" (arXiv:2605.00797v1, Chuzhoy–Khanna–Song, STOC 2026). This package implements a deterministic algorithm ...
Abstract: Baswana, Gupta and Sen [FOCS'11] showed that fully dynamic maximal matching can be maintained in general graphs with logarithmic amortized update time. More specifically, starting from an ...
Abstract: Maximal Independent Set (MIS) and Maximal Matching (MM) play a vital role in distributed symmetry breaking. Despite decades of research, the complexity of both problems in the standard LOCAL ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results