Minimum Degree-Based Core Decomposition

In this chapter, we discuss efficient techniques for computing the minimum degree-based graph decomposition (aka, core decomposition). Preliminaries are given in Section 3.1. A linear-time algorithm is presented in Section 3.2, while h-index-based local algorithms that can be naturally made parallel are presented in Section 3.3.

[1]  Jeffrey Xu Yu,et al.  Efficient Core Maintenance in Large Dynamic Graphs , 2012, IEEE Transactions on Knowledge and Data Engineering.

[2]  Michalis Vazirgiannis,et al.  Core Decomposition in Graphs: Concepts, Algorithms and Applications , 2016, EDBT.

[3]  Tao Zhou,et al.  The H-index of a network node and its relation to degree and coreness , 2016, Nature Communications.

[4]  James Cheng,et al.  Efficient core decomposition in massive networks , 2011, 2011 IEEE 27th International Conference on Data Engineering.

[5]  J. E. Hirsch,et al.  An index to quantify an individual's scientific research output , 2005, Proc. Natl. Acad. Sci. USA.

[6]  Jeffrey Xu Yu,et al.  Influential Community Search in Large Networks , 2015, Proc. VLDB Endow..

[7]  Francesco De Pellegrini,et al.  Distributed k-Core Decomposition , 2013 .

[8]  Kun-Lung Wu,et al.  Streaming Algorithms for k-core Decomposition , 2013, Proc. VLDB Endow..

[9]  Norishige Chiba,et al.  Arboricity and Subgraph Listing Algorithms , 1985, SIAM J. Comput..

[10]  Francesco Bonchi,et al.  Core decomposition of uncertain graphs , 2014, KDD.

[11]  Francesco De Pellegrini,et al.  General , 1895, The Social History of Alcohol Review.

[12]  Jeffrey Xu Yu,et al.  Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity , 2015, SIGMOD Conference.

[13]  Jeffrey Xu Yu,et al.  I/O efficient Core Graph Decomposition at web scale , 2015, 2016 IEEE 32nd International Conference on Data Engineering (ICDE).

[14]  Kun-Lung Wu,et al.  Incremental k-core decomposition: algorithms and evaluation , 2016, The VLDB Journal.

[15]  Ali Pinar,et al.  Parallel Local Algorithms for Core, Truss, and Nucleus Decompositions , 2017, ArXiv.

[16]  Dimitrios M. Thilikos,et al.  Evaluating Cooperation in Communities with the k-Core Structure , 2011, 2011 International Conference on Advances in Social Networks Analysis and Mining.

[17]  Alex Thomo,et al.  K-Core Decomposition of Large Networks on a Single PC , 2015, Proc. VLDB Endow..

[18]  Ali Pinar,et al.  Fast Hierarchy Construction for Dense Subgraphs , 2016, Proc. VLDB Endow..

[19]  D. R. Lick,et al.  k-Degenerate Graphs , 1970, Canadian Journal of Mathematics.

[20]  Jeffrey Xu Yu,et al.  A Fast Order-Based Approach for Core Maintenance , 2016, 2017 IEEE 33rd International Conference on Data Engineering (ICDE).

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

[22]  Leland L. Beck,et al.  Smallest-last ordering and clustering and graph coloring algorithms , 1983, JACM.