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 …

The k-plex model relaxes the clique model by allowing each vertex to miss up to k
neighbors, including the vertex itself. A 1-plex is a clique. Many exact algorithms have been …

Finding cohesive subgraphs from a bipartite graph is a fundamental operator in bipartite
graph analysis. In this paper, we focus on the problem of mining cohesive subgraphs from a …

Mining cohesive subgraphs from a graph is a fundamental problem in graph data analysis.
One notable cohesive structure is γ-quasi-clique (QC), where each vertex connects at least a …

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 …

Finding cohesive subgraphs from a directed graph is a fundamental approach to analyze
directed graph data. We consider a new model called directed (k,ℓ)-plex for a cohesive …

A k-biplex is an induced subgraph of a bipartite graph which requires every vertex on the
one side disconnecting at most k vertices on the other side. Enumerating all maximal k …

As a typical most-to-most connected quasi-biclique model, k-biplex allows nodes on each
side of a fully connected subgraph to lose at most k connections. In this paper, we …

The s-bundle, as a cohesive subgraph model which relaxes the clique, remains connected
whenever fewer than ns vertices are removed, where n is the number of vertices inside …

Community search in bipartite graphs is an essential problem extensively studied, which
aims at retrieving high-quality communities. And k-wing is a cohesive subgraph where …