Bipartite graphs are widely used to model relation-ships between two types of entities.
Community search retrieves densely connected subgraphs containing a query vertex, which …

The studies of k-truss based community search demonstrated that it can find high-quality
personalized com-munities with good properties such as high connectivity and bounded …

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 recent years, cohesive subgraph mining in bipartite graphs becomes a popular research
topic. An important cohesive subgraph model k-bitruss is the maximal cohesive subgraph …

In many real-world applications, bipartite graphs are naturally used to model relationships
between two types of entities. Community discovery over bipartite graphs is a fundamental …

Hypergraphs are a powerful abstraction for modeling high-order relations, which are
ubiquitous in many fields. A hypergraph consists of nodes and hyperedges (ie, subsets of …

Community search studies the retrieval of certain community structures containing query
vertices, which has received lots of attention recently. k-truss is a fundamental community …

The structural stability of a network reflects the ability of the network to maintain a
sustainable service. As the leave of some users will significantly break network stability, it is …

Querying cohesive subgraphs on temporal graphs with various time constraints has
attracted intensive research interests recently. In this paper, we study a novel Temporal k …

Community search is a problem that seeks cohesive and connected subgraphs in a graph
that satisfy certain topology constraints, eg, degree constraints. The majority of existing …