206 citations · 303 across the 29 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DS2020
A Note on a Recent Algorithm for Minimum Cut
Paweł Gawrychowski, Shay Mozes, Oren Weimann
Given an undirected edge-weighted graph with edges and vertices, the minimum cut problem asks to find a subset of vertices such that the total weight of all e…
cs.DS2020
On the Fine-Grained Complexity of Parity Problems
Amir Abboud, Shon Feller, Oren Weimann
We consider the parity variants of basic problems studied in fine-grained complexity. We show that finding the exact solution is just as hard as finding its parity (i.e. if the sol…