Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams

While in many graph mining applications it is crucial to handle a stream of updates efficiently in terms of both time and space, not much was known about achieving such type of algorithm. In this paper we study this issue for a problem which lies at the core of many graph mining applications called densest subgraph problem. We develop an algorithm that achieves time- and space-efficiency for this problem simultaneously. It is one of the first of its kind for graph problems to the best of our knowledge. Given an input graph, the densest subgraph is the sub graph that maximizes the ratio between the number of edges and the number of nodes. For any > 0, our algorithm can, with high probability, maintain a (4 + 0-approximate solution under edge insertions and deletions using 0(n) space and 6(1) amortized time per update; here, n is the number of nodes in the graph and O hides the 0(poly n) term. The approximation ratio can be improved to (2 + 6) with more time. It can be extended to a (2 + 0-approximation sublinear-time algorithm and a distributed-streaming algorithm. Our algorithm is the first streaming algorithm that can maintain the densest subgraph in one pass. Prior to this, no algorithm could do so even in the special case of an incremental stream and even when there is no time restriction. The previously best algorithm in this setting required 0(log n) passes [6]. The space required by our algorithm is tight up to a polylogarithmic factor.