1 citations · 5 across the 17 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.PR2021★ 1 cited
Sequential importance sampling for estimating expectations over the space of perfect matchings
Yeganeh Alimohammadi, Persi Diaconis, Mohammad Roghani +1
This paper makes three contributions to estimating the number of perfect matching in bipartite graphs. First, we prove that the popular sequential importance sampling algorithm wor…
cs.DS2021
Beating the Folklore Algorithm for Dynamic Matching
Mohammad Roghani, Amin Saberi, David Wajc
The maximum matching problem in dynamic graphs subject to edge updates (insertions and deletions) has received much attention over the last few years; a multitude of approximation/…