38 citations · 53 across the 13 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.DS2023
Finding a Small Vertex Cut on Distributed Networks
Yonggang Jiang, Sagnik Mukhopadhyay
We present an algorithm for distributed networks to efficiently find a small vertex cut in the CONGEST model. Given a positive integer , our algorithm can, with high probability…
cs.DS2023★ 1 cited
Fast Algorithms via Dynamic-Oracle Matroids
Joakim Blikstad, Sagnik Mukhopadhyay, Danupon Nanongkai +1
We initiate the study of matroid problems in a new oracle model called dynamic oracle. Our algorithms in this model lead to new bounds for some classic problems, and a "unified" al…