Simplified Algorithms for Order-Based CoreMaintenance

Graph analytics attract much attention from both research and industry communities. Due to its linear time complexity, the $k$-core decomposition is widely used in many real-world applications such as biology, social networks, community detection, ecology, and information spreading. In many such applications, the data graphs continuously change over time. The changes correspond to edge insertion and removal. Instead of recomputing the $k$-core, …