With the advent of the electric power big data era, semantic interoperability and
interconnection of power data have received extensive attention. Knowledge graph …

Densest subgraph computation has emerged as an important primitive in a wide range of
data analysis tasks such as community and event detection. Social media such as Facebook …

Graphs have been widely used in many applications such as social networks, collaboration
networks, and biological networks. One important graph analytics is to explore cohesive …

In social networks, the leave of critical users may significantly break network engagement,
ie, lead a large number of other users to drop out. A popular model to measure social …

As a fundamental problem in graph analysis, core decomposition aims to compute the core
numbers of vertices in a given graph. It is a powerful tool for mining important graph …

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 …

This article studies the core maintenance problem for dynamic graphs which requires to
update each vertex's core number with the insertion/deletion of vertices/edges. Previous …

In this paper, we study the problem of the anchored k-core. Given a graph G, an integer k
and a budget b, we aim to identify b vertices in G so that we can determine the largest …

Graph processing has become an important part of various areas of computing, including
machine learning, medical applications, social network analysis, computational sciences …

Graph processing has become an important part of various areas of computing, including
machine learning, medical applications, social network analysis, computational sciences …