4 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.DS2015★ 4 cited
Densest Subgraph in Dynamic Graph Streams
Andrew McGregor, David Tench, Sofya Vorotnikova +1
In this paper, we consider the problem of approximating the densest subgraph in the dynamic graph stream model. In this model of computation, the input graph is defined by an arbit…
cs.DS2015
Run Generation Revisited: What Goes Up May or May Not Come Down
Michael A. Bender, Samuel McCauley, Andrew McGregor +2
In this paper, we revisit the classic problem of run generation. Run generation is the first phase of external-memory sorting, where the objective is to scan through the data, reor…