Fast Algorithms for Constrained Graph Density Problems
We consider the question of finding communities in large social networks. In literature and practice, “communities” refer to a well-connected subgraph of the entire network. For instance, the notion of graph density has been considered as a reasonable measure of a community. Researchers have also looked at the minimum degree of a subgraph as a measure of the connectedness of the community.
Typically, a community is meaningful in the context of a social network if it is of somewhat significant size. Thus, earlier work has considered the densest graph problem subject to various co-matroid constraints. Most of these algorithms utilize an exact dense subgraph procedure as a subroutine; such a subroutine involves computing maximum flows or solving LPs. Consequently, they are rather inefficient when considered for massive graphs. For massive graphs, we are constrained to run in near-linear time, while producing subgraphs that provide reasonable approximations to the optimal solutions.
Our current work presents efficient greedy algorithms for the problem of graph density subject to an even more general class of constraints called upward-monotone constraints (these subsume co-matroid constraints). This generalizes and extends earlier work significantly. For instance, we are thereby able to present near-linear time 3-factor approximation algorithms for density subject to co-matroid constraints; we are also able to obtain 2-factor LP-based algorithms for density subject to 2 co-matroid constraints.
Our algorithms heavily utilize the core decomposition of a graph.
KeywordsMinimum Degree Vertex Cover Unconstrained Optimum Problem Extend Graph Density
Unable to display preview. Download preview PDF.
- 3.Bhaskara, A., Charikar, M., Chlamtac, E., Feige, U., Vijayaraghavan, A.: Detecting high log-densities: an o(n1/4) approximation for densest k-subgraph. In: STOC, pp. 201–210 (2010)Google Scholar
- 4.Chakaravarthy, V.T., Modani, N., Natarajan, S.R., Roy, S., Sabharwal, Y.: Density functions subject to a co-matroid constraint. In: FSTTCS, pp. 236–248 (2012)Google Scholar
- 6.Eisenstat, D., Klein, P.N.: Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs. In: Symposium on Theory of Computing Conference, STOC 2013, Palo Alto, CA, USA, June 1-4, pp. 735–744 (2013)Google Scholar
- 8.Gajewar, A., Sarma, A.D.: Multi-skill collaborative teams based on densest subgraphs. In: SDM, pp. 165–176 (2012)Google Scholar
- 9.Goldberg, A.V.: Finding a maximum density subgraph. Technical report, UC Berkeley (1984)Google Scholar
- 10.Kelner, J.A., Lee, Y.T., Orecchia, L., Sidford, A.: An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, pp. 217–226 (2014)Google Scholar
- 16.Rangapuram, S.S., Bühler, T., Hein, M.: Towards realistic team formation in social networks based on densest subgraphs. In: Proceedings of the 22nd International Conference on World Wide Web, WWW 2013, pp. 1077–1088 (2013)Google Scholar
- 18.Schrijver, A.: Combinatorial Optimization - Polyhedra and Efficiency. Springer (2003)Google Scholar
- 19.Sherman, J.: Nearly maximum flows in nearly linear time. In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, Berkeley, CA, USA, October 26-29, pp. 263–269 (2013)Google Scholar
- 20.Sozio, M., Gionis, A.: The community-search problem and how to plan a successful cocktail party. In: KDD, pp. 939–948 (2010)Google Scholar