With the rapid development of information technologies, various big graphs are prevalent in
many real applications (eg, social media and knowledge bases). An important component of …

In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …

The core decomposition of networks has attracted significant attention due to its numerous
applications in real-life problems. Simply stated, the core decomposition of a network …

The problem of computing (α, β)-core in a bipartite graph for given α and β is a fundamental
problem in bipartite graph analysis and can be used in many applications such as online …

Maximal bicliques are effective to reveal meaningful information hidden in bipartite graphs.
Maximal biclique enumeration (MBE) is challenging since the number of the maximal …

The problem of computing (α, β α, β)-core in a bipartite graph for given α α and β β is a
fundamental problem in bipartite graph analysis and can be used in many applications such …

Community detection is one of the most fundamental problems in social network analysis,
while most existing research focuses on unsigned graphs. In real applications, social …

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 …

The model of k-core and its decomposition have been applied in various areas, such as
social networks, the world wide web, and biology. A graph can be decomposed into an …

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 …