14 citations · 16 across the 3 of their papers we have counts for
3 papers
cs.DS2017★ 14 cited
Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams
Sagar Kale, Sumedh Tirodkar
We consider the maximum matching problem in the semi-streaming model formalized by Feigenbaum, Kannan, McGregor, Suri, and Zhang that is inspired by giant graphs of today. As our m…
cs.DS2016★ 1 cited
Maximum Matching on Trees in the Online Preemptive and the Incremental Dynamic Graph Models
Sumedh Tirodkar, Sundar Vishwanathan
We study the Maximum Cardinality Matching (MCM) and the Maximum Weight Matching (MWM) problems, on trees and on some special classes of graphs, in the Online Preemptive and the Inc…
cs.DS2014★ 1 cited
On Randomized Algorithms for Matching in the Online Preemptive Model
Ashish Chiplunkar, Sumedh Tirodkar, Sundar Vishwanathan
We investigate the power of randomized algorithms for the maximum cardinality matching (MCM) and the maximum weight matching (MWM) problems in the online preemptive model. In this…