Discounted average degree density metric and new algorithms for the densest subgraph problem

Detecting the densest subgraph is one of the most important problems in graph mining and has a variety of applications. Although there are many possible metrics for subgraph density, there is no consensus on which density metric we should use. In this article, we suggest a new density metric, the discounted average degree, which has some desirable properties of the subgraph's density. We also show how to obtain an optimum densest subgraph for small graphs with respect to several density metrics, including our new density metric, by using mixed integer programming. Finally, we develop a new heuristic algorithm to quickly obtain a good approximate solution for large graphs. Our computational experiments on real‐world graphs showed that our new heuristic algorithm outperformed other heuristics in terms of the quality of the solutions. © 2017 Wiley Periodicals, Inc. NETWORKS, Vol. 71(1), 3–15 2018

[1]  Satoshi Hara,et al.  Axioms of Density : How to Define and Detect the Densest Subgraph , 2016 .

[2]  Charalampos E. Tsourakakis.  A Novel Approach to Finding Near-Cliques: The Triangle-Densest Subgraph Problem , 2014, ArXiv.

[3]  Charalampos E. Tsourakakis,et al.  Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees , 2013, KDD.

[4]  Charalampos E. Tsourakakis,et al.  Colorful triangle counting and a MapReduce implementation , 2011, Inf. Process. Lett..

[5]  Timothy A. Davis,et al.  The university of Florida sparse matrix collection , 2011, TOMS.

[6]  Sergiy Butenko,et al.  Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem , 2011, Oper. Res..

[7]  Anthony K. H. Tung,et al.  On Triangulation-based Dense Neighborhood Graphs Discovery , 2010, Proc. VLDB Endow..

[8]  Aditya Bhaskara,et al.  Detecting high log-densities: an O(n¼) approximation for densest k-subgraph , 2010, STOC '10.

[9]  Charu C. Aggarwal,et al.  A Survey of Algorithms for Dense Subgraph Discovery , 2010, Managing and Mining Graph Data.

[10]  Kumar Chellapilla,et al.  Finding Dense Subgraphs with Size Bounds , 2009, WAW.

[11]  S. Safra,et al.  On the hardness of approximating minimum vertex cover , 2005 .

[12]  Jiawei Han,et al.  Mining coherent dense subgraphs across massive biological networks for functional discovery , 2005, ISMB.

[13]  Sandra Sudarsky,et al.  Massive Quasi-Clique Detection , 2002, LATIN.

[14]  Moses Charikar,et al.  Greedy approximation algorithms for finding dense components in a graph , 2000, APPROX.

[15]  Hisao Tamaki,et al.  Greedily Finding a Dense Subgraph , 1996, J. Algorithms.

[16]  Robert E. Tarjan,et al.  A Fast Parametric Maximum Flow Algorithm and Applications , 1989, SIAM J. Comput..

[17]  Andrew V. Goldberg,et al.  Finding a Maximum Density Subgraph , 1984 .

[18]  Stephen B. Seidman,et al.  Network structure and minimum degree , 1983 .

[19]  Stephen B. Seidman,et al.  A graph‐theoretic generalization of the clique concept* , 1978 .

[20]  R. J. Mokken,et al.  Cliques, clubs and clans , 1979 .

[21]  C. Parrack.  Cliques , 1966, The Mathematical Gazette.

[22]  R. Luce,et al.  Connectivity and generalized cliques in sociometric group structure , 1950, Psychometrika.