© 2020, VLDB Endowment. Maximum biclique search, which finds the biclique with the
maximum number of edges in a bipartite graph, is a fun-damental problem with a wide …

With the advent of a wide spectrum of recent applications, querying heterogeneous
information networks (HINs) has received a great deal of attention from both academic and …

Given a bipartite graph, the maximum balanced biclique (MBB) problem, discovering a
mutually connected while disjoint sets of equal size with the maximum cardinality, plays a …

Bipartite graphs are naturally used to model relationships between two different types of
entities. On bipartite graphs, maximum biclique search is a fundamental problem that aims to …

The minimum 2-fold connected dominating set problem (M (2-fold) CDSP) is an important
variant of the traditional minimum connected dominating set problem (MCDSP), with crucial …

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 …

Enumerating maximal k-biplexes (MBPs) of a bipartite graph has been used for applications
such as fraud detection. Nevertheless, there usually exists an exponential number of MBPs …

Maximum biclique search, which finds the biclique with the maximum number of edges in a
bipartite graph, is a fundamental problem with a wide spectrum of applications in different …

With the advent of a wide spectrum of recent applications, querying large heterogeneous
information networks (HINs) has received a great deal of attention from both academic and …

Identifying the critical nodes in a network is crucial for understanding its characteristics,
controlling its structure, and determining its functionality. Cardinality-constrained CNP (CC …