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 …

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 …

Clique, as a fundamental model for graph analysis, is widely investigated in the literature.
However, with the emergence of various graph data, such as signed graph, novel clique …

In this paper, we study the problem of maximal biclique enumeration on large signed
bipartite graphs. Given a signed bipartite graph, a parameter, our goal is to efficiently …

Enumerating cohesive subgraphs is a fundamental problem for signed network analysis. In
this paper, we propose a novel model, called maximal signed k-clique, which aims to find …

Signed bipartite graphs represent relationships between two sets of entities, including both
positive and negative interactions, allowing for a more comprehensive modeling of real …

Community detection is a fundamental problem in social network analysis, and most existing
studies focus on unsigned graphs, ie, treating all relationships as positive. However, friend …

Maximum biclique identification, which aims to find the biclique with the largest size, can find
a wide spectrum of applications in different domains, such as E-Commerce, healthcare and …

Mining cohesive subgraphs from a network is a fundamental problem in network analysis.
Most existing cohesive subgraph models are mainly tailored to unsigned networks. In this …

Mining cohesive subgraphs is a fundamental problem in social network analysis. The k-truss
model has been widely used to measure the cohesiveness of subgraphs. Most existing …