100 citations · 371 across the 26 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021★ 1 cited
Revisiting the Auction Algorithm for Weighted Bipartite Perfect Matchings
Megha Khosla, Avishek Anand
We study the classical weighted perfect matchings problem for bipartite graphs or sometimes referred to as the assignment problem, i.e., given a weighted bipartite graph $G = (U\cu…
cs.DS2016
A Faster Algorithm for Cuckoo Insertion and Bipartite Matching in Large Graphs
Megha Khosla, Avishek Anand
Hash tables are ubiquitous in computer science for efficient access to large datasets. However, there is always a need for approaches that offer compact memory utilisation without…