2 citations · 5 across the 8 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DS2022
Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms
Sepehr Assadi, Amit Chakrabarti, Prantar Ghosh +1
In recent years, there has been a growing interest in solving various graph coloring problems in the streaming model. The initial algorithms in this line of work are all crucially…
cs.DS2022
A New Dynamic Algorithm for Densest Subhypergraphs
Suman K. Bera, Sayan Bhattacharya, Jayesh Choudhari +1
Computing a dense subgraph is a fundamental problem in graph mining, with a diverse set of applications ranging from electronic commerce to community detection in social networks.…