Skip to main content
OSTI.GOVU.S. Department of Energy Office of Scientific and Technical Information
U.S. Department of Energy
Office of Scientific and Technical Information
 

Incremental k-core decomposition: Algorithms and evaluation

Journal Article · · The VLDB Journal
 [1];  [2];  [3];  [3];  [4]
  1. Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
  2. Bilkent Univ., Ankara (Turkey)
  3. IBM T.J. Watson Research Center, Yorktown Heights, NY (United States)
  4. The Ohio State Univ., Columbus, OH (United States)
+ Show Author Affiliations
A k-core of a graph is a maximal connected subgraph in which every vertex is connected to at least k vertices in the subgraph. k-core decomposition is often used in large-scale network analysis, such as community detection, protein function prediction, visualization, and solving NP-hard problems on real networks efficiently, like maximal clique finding. In many real-world applications, networks change over time. As a result, it is essential to develop efficient incremental algorithms for dynamic graph data. In this paper, we propose a suite of incremental k-core decomposition algorithms for dynamic graph data. These algorithms locate a small subgraph that is guaranteed to contain the list of vertices whose maximum k-core values have changed and efficiently process this subgraph to update the k-core decomposition. We present incremental algorithms for both insertion and deletion operations, and propose auxiliary vertex state maintenance techniques that can further accelerate these operations. Our results show a significant reduction in runtime compared to non-incremental alternatives. We illustrate the efficiency of our algorithms on different types of real and synthetic graphs, at varying scales. Furthermore, for a graph of 16 million vertices, we observe relative throughputs reaching a million times, relative to the non-incremental algorithms.
Research Organization:
Sandia National Laboratories (SNL-CA), Livermore, CA (United States)
Sponsoring Organization:
USDOE National Nuclear Security Administration (NNSA)
Grant/Contract Number:
AC04-94AL85000
OSTI ID:
1239351
Report Number(s):
SAND2016-1193J; 619260
Journal Information:
The VLDB Journal, Journal Name: The VLDB Journal Journal Issue: 10 Vol. 9; ISSN 1066-8888
Country of Publication:
United States
Language:
English

References (28)

Peeling the yeast protein network journal February 2005
Design principles for developing stream processing applications journal August 2010
Generating Sparse 2-Spanners journal September 1994
A graph-theoretic algorithm for comparative modeling of protein structure 1 1Edited by F. Cohen journal May 1998
Generating sparse 2—spanners book January 1992
Characterization of Graphs Using Degree Cores
  • Healy, John; Janssen, Jeannette; Milios, Evangelos
  • Algorithms and Models for the Web-Graph: Fourth International Workshop, WAW 2006, Banff, Canada, November 30 - December 1, 2006, Revised Papers https://doi.org/10.1007/978-3-540-78808-9_13
book January 2008
Finding Dense Subgraphs with Size Bounds book January 2009
On chromatic number of graphs and set-systems journal March 1966
D-cores: measuring collaboration of directed graphs based on degeneracy journal September 2012
Size and connectivity of the k-core of a random graph journal August 1991
Network structure and minimum degree journal September 1983
k -Core Organization of Complex Networks journal February 2006
Comparison of Feature-Based Criminal Network Detection Models with k-Core and n-Clique conference August 2010
Evaluating Cooperation in Communities with the k-Core Structure
  • Giatsidis, Christos; Thilikos, Dimitrios M.; Vazirgiannis, Michalis
  • 2011 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2011) https://doi.org/10.1109/ASONAM.2011.65
conference July 2011
Efficient core decomposition in massive networks
  • Cheng, James; Ke, Yiping; Chu, Shumo
  • 2011 IEEE International Conference on Data Engineering (ICDE 2011), 2011 IEEE 27th International Conference on Data Engineering https://doi.org/10.1109/ICDE.2011.5767911
conference April 2011
Extracting Analyzing and Visualizing Triangle K-Core Motifs within Networks
  • Zhang, Yang; Parthasarathy, Srinivasan
  • 2012 IEEE International Conference on Data Engineering (ICDE 2012), 2012 IEEE 28th International Conference on Data Engineering https://doi.org/10.1109/ICDE.2012.35
conference April 2012
D-cores: Measuring Collaboration of Directed Graphs Based on Degeneracy conference December 2011
Distributed $k$ -Core View Materialization and Maintenance for Large Dynamic Graphs journal October 2014
Emergence of Scaling in Random Networks journal October 1999
R-MAT: A Recursive Model for Graph Mining conference December 2013
On the structural properties of massive telecom call graphs: findings and implications conference January 2006
Extraction and classification of dense communities in the web conference January 2007
A large-scale study of link spam detection by graph algorithms
  • Saito, Hiroo; Toyoda, Masashi; Kitsuregawa, Masaru
  • Proceedings of the 3rd international workshop on Adversarial information retrieval on the web - AIRWeb '07 https://doi.org/10.1145/1244408.1244417
conference January 2007
R-MAT: A Recursive Model for Graph Mining text January 2018
R-MAT: A Recursive Model for Graph Mining text January 2018
Clique Relaxations in Social Network Analysis: The Maximum k -Plex Problem journal February 2011
Streaming algorithms for k-core decomposition journal April 2013
Augmenting $k$-core generation with preferential attachment journal January 2008

Cited By (8)

Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk) text January 2022
Core Decomposition of Massive, Information-Rich Graphs book January 2017
Core Decomposition of Massive, Information-Rich Graphs book January 2018
Effective and efficient attributed community search journal September 2017
A survey of community search over big graphs journal July 2019
The core decomposition of networks: theory, algorithms and applications journal November 2019
Coreness Variation Rule and Fast Updating Algorithm for Dynamic Networks journal April 2019
A Survey of Community Search Over Big Graphs preprint January 2019

Similar Records

Finding Hierarchical and Overlapping Dense Subgraphs using Nucleus Decompositions
Technical Report · Sat Nov 01 00:00:00 EDT 2014 · OSTI ID:1172917
Understanding the Hierarchy of Dense Subgraphs in Stationary and Temporally Varying Setting
Technical Report · Fri Sep 01 00:00:00 EDT 2017 · OSTI ID:1527314
Theoretically and practically efficient parallel nucleus decomposition
Journal Article · Mon Nov 01 00:00:00 EDT 2021 · Proceedings of the VLDB Endowment · OSTI ID:1980995

Related Subjects

97 MATHEMATICS AND COMPUTING