Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Vladimir Batagelj and Matjaz Zaversnik. An o(m) algorithm for cores decomposition of networks. CoRR, cs.DS/0310049, 2003.
Francesco Bonchi, Francesco Gullo, Andreas Kaltenbrunner, and Yana Volkovich. Core decomposition of uncertain graphs. In Proc. of KDD’14, pages 1316–1325, 2014.
Lijun Chang, Xuemin Lin, Lu Qin, Jeffrey Xu Yu, and Wenjie Zhang. Index-based optimal algorithms for computing Steiner components with maximum connectivity. In Proc. of SIGMOD’15, 2015.
James Cheng, Yiping Ke, Shumo Chu, and M. Tamer Özsu. Efficient core decomposition in massive networks. In Proc. of ICDE’11, pages 51–62, 2011.
Norishige Chiba and Takao Nishizeki. Arboricity and subgraph listing algorithms. SIAM J. Comput., 14(1):210–223, 1985.
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms (3. ed.). MIT Press, 2009.
A. Erdem Sariyuce, C. Seshadhri, and A. Pinar. Parallel Local Algorithms for Core, Truss, and Nucleus Decompositions. ArXiv e-prints, 2017.
Christos Giatsidis, Dimitrios M. Thilikos, and Michalis Vazirgiannis. Evaluating cooperation in communities with the k-core structure. In Proc. of ASONAM’11, pages 87–93, 2011.
Christos Giatsidis, Dimitrios M. Thilikos, and Michalis Vazirgiannis. D-cores: measuring collaboration of directed graphs based on degeneracy. Knowl. Inf. Syst., 35(2):311–343, 2013.
J. E. Hirsch. An index to quantify an individual’s scientific research output. Proceedings of the National Academy of Sciences of the United States of America, 102(46):16569–16572, 2005.
Wissam Khaouid, Marina Barsky, Venkatesh Srinivasan, and Alex Thomo. K-core decomposition of large networks on a single pc. PVLDB, 9(1):13–23, 2015.
Rong-Hua Li, Lu Qin, Jeffrey Xu Yu, and Rui Mao. Influential community search in large networks. PVLDB, 8(5):509–520, 2015.
Rong-Hua Li, Jeffrey Xu Yu, and Rui Mao. Efficient core maintenance in large dynamic graphs. IEEE Trans. Knowl. Data Eng., 26(10):2453–2465, 2014.
Don R. Lick and Arthur T. White. k-degenerate graphs. Canadian Journal of Mathematics, 22:1082–1096, 1970.
Linyuan Lü, Tao Zhou, Qian-Ming Zhang, and H. E. Stanley. The h-index of a network node and its relation to degree and coreness. Nature Communications, 7:10168, 2016.
Fragkiskos D. Malliaros, Apostolos N. Papadopoulos, and Michalis Vazirgiannis. Core decomposition in graphs: Concepts, algorithms and applications. In Proc. of EDBT’16, pages 720–721, 2016.
David W. Matula and Leland L. Beck. Smallest-last ordering and clustering and graph coloring algorithms. J. ACM, 30(3):417–427, 1983.
Alberto Montresor, Francesco De Pellegrini, and Daniele Miorandi. Distributed k-core decomposition. In Proc. of PODC’11, pages 207–208, 2011.
Francesco De Pellegrini, Alberto Montresor, and Daniele Miorandi. Distributed k-core decomposition. IEEE Transactions on Parallel & Distributed Systems, 24:288–300, 2013.
Ahmet Erdem Sariyüce, Bugra Gedik, Gabriela Jacques-Silva, Kun-Lung Wu, and Ümit V. Çatalyürek. Streaming algorithms for k-core decomposition. PVLDB, 6(6):433–444, 2013.
Ahmet Erdem Sariyüce, Bugra Gedik, Gabriela Jacques-Silva, Kun-Lung Wu, and Ümit V. Çatalyürek. Incremental k-core decomposition: algorithms and evaluation. VLDB J., 25(3):425–447, 2016.
Ahmet Erdem Sariyüce and Ali Pinar. Fast hierarchy construction for dense subgraphs. PVLDB, 10(3):97–108, 2016.
Stephen B. Seidman. Network structure and minimum degree. Social Networks, 5(3):269–287, 1983.
Dong Wen, Lu Qin, Ying Zhang, Xuemin Lin, and Jeffrey Xu Yu. I/O efficient core graph decomposition at web scale. In Proc. of ICDE’16, 2016.
Yikai Zhang, Jeffrey Xu Yu, Ying Zhang, and Lu Qin. A fast order-based approach for core maintenance. In Proc. of ICDE’11, pages 337–348, 2017.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Chang, L., Qin, L. (2018). Minimum Degree-Based Core Decomposition. In: Cohesive Subgraph Computation over Large Sparse Graphs. Springer Series in the Data Sciences. Springer, Cham. https://doi.org/10.1007/978-3-030-03599-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-03599-0_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-03598-3
Online ISBN: 978-3-030-03599-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)