Biclique percolation community (BPC) search is a fundamental problem in bipartite graph
analysis and have many applications. Existing online approach has to enumerate all the …

As an important cohesive subgraph model in bipartite graphs, the (α, β)-core (aka bi-core)
has found a wide spectrum of real-world applications, such as product recommendation …

Uncertain butterflies are one of, if not the, most important graphlet structures on uncertain
bipartite networks. In this paper, we examine the uncertain butterfly structure (in which the …

Many real-world binary relations can be modelled as bipartite graphs, which can be
inherently temporal and each edge is associated with a timestamp. The (α, β)-core, a …

Community search over bipartite graphs is a crucial issue with significant applications in
various domains, including group recommendations, fraud detection and representation …

In real-world applications, bipartite graphs are commonly used to represent relationships
between two types of entities. However, existing studies in community discovery on bipartite …

This paper addresses the pressing need for effective k-tips decomposition in dynamic
bipartite graphs, a crucial aspect of real-time applications that analyze and mine binary …

Finding the maximum biclique in a bipartite graph is a fundamental graph analysis problem.
Existing methods for maximum biclique search are not very efficient because they cannot …

Temporal bipartite graphs are widely used to denote time-evolving relationships between
two disjoint sets of nodes, such as customer-product interactions in E-commerce and user …

Community search on attributed weighted bipartite graphs is an essential problem and its
aim is to retrieve high-quality communities containing a query vertex. An important …