3 citations · 3 across the 6 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2024
Approximate Bipartite -Matching using Multiplicative Auction
Bhargav Samineni, S M Ferdous, Mahantesh Halappanavar +1
Given a bipartite graph with vertices and edges and a function , a -matching is a subset of edges such that every verte…
cs.DS2023
Semi-Streaming Algorithms for Weighted -Disjoint Matchings
S M Ferdous, Bhargav Samineni, Alex Pothen +2
We design and implement two single-pass semi-streaming algorithms for the maximum weight -disjoint matching (-DM) problem. Given an integer , the -DM problem is to find…