Efficient NC algorithms for set cover with applications to learning and geometry
Proceedings of the 30th IEEE symposium on Foundations of computer science
Reductions in streaming algorithms, with an application to counting triangles in graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Reachability and distance queries via 2-hop labels
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Greedy approximation algorithms for finding dense components in a graph
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Finding a Maximum Density Subgraph
Finding a Maximum Density Subgraph
Statistical mechanics of complex networks
Statistical mechanics of complex networks
Finding frequent items in data streams
Theoretical Computer Science - Special issue on automata, languages and programming
An information statistics approach to data stream and communication complexity
Journal of Computer and System Sciences - Special issue on FOCS 2002
Discovering large dense subgraphs in massive graphs
VLDB '05 Proceedings of the 31st international conference on Very large data bases
On graph problems in a semi-streaming model
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Structure and evolution of online social networks
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
Google news personalization: scalable online collaborative filtering
Proceedings of the 16th international conference on World Wide Web
Extraction and classification of dense communities in the web
Proceedings of the 16th international conference on World Wide Web
MapReduce: simplified data processing on large clusters
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
A scalable pattern mining approach to web graph compression with communities
WSDM '08 Proceedings of the 2008 International Conference on Web Search and Data Mining
Efficient semi-streaming algorithms for local triangle counting in massive graphs
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Finding Dense Subgraphs with Size Bounds
WAW '09 Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph
3-HOP: a high-compression indexing scheme for reachability query
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Managing and Mining Graph Data
Managing and Mining Graph Data
Proceedings of the 19th international conference on World wide web
On distributing symmetric streaming computations
ACM Transactions on Algorithms (TALG)
A model of computation for MapReduce
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Counting triangles and the curse of the last reducer
Proceedings of the 20th international conference on World wide web
Social content matching in MapReduce
Proceedings of the VLDB Endowment
Filtering: a method for solving graph problems in MapReduce
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Distributed cube materialization on holistic measures
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Finding graph matchings in data streams
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Dense subgraphs with restrictions and applications to gene annotation graphs
RECOMB'10 Proceedings of the 14th Annual international conference on Research in Computational Molecular Biology
Dense Subgraph Extraction with Application to Community Detection
IEEE Transactions on Knowledge and Data Engineering
Proceedings of the VLDB Endowment
Dense subgraphs on dynamic networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Online search of overlapping communities
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Fast greedy algorithms in mapreduce and streaming
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Efficient processing of streaming graphs for evolution-aware clustering
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Integration of dense subgraph finding with feature clustering for unsupervised feature selection
Pattern Recognition Letters
| Hi-index | 0.00 |
The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and the discovery of biological network modules. In this paper we present new algorithms for finding the densest subgraph in the streaming model. For any ε 0, our algorithms make O(log1+ε n) passes over the input and find a subgraph whose density is guaranteed to be within a factor 2(1 + ε) of the optimum. Our algorithms are also easily parallelizable and we illustrate this by realizing them in the MapReduce model. In addition we perform extensive experimental evaluation on massive real-world graphs showing the performance and scalability of our algorithms in practice.