Efficient size-bounded community search over large networks
The problem of community search, which aims to find a cohesive subgraph containing user-
given query vertices, has been extensively studied recently. Most of the existing studies …
given query vertices, has been extensively studied recently. Most of the existing studies …
Effective and efficient relational community detection and search in large dynamic heterogeneous information networks
Community search in heterogeneous information networks (HINs) has attracted much
attention in graph analysis. Given a vertex, the goal is to find a densely-connected sub …
attention in graph analysis. Given a vertex, the goal is to find a densely-connected sub …
Densely connected user community and location cluster search in location-based social networks
Searching for a community based on query nodes in a graph is a fundamental problem and
has been extensively investigated. Most of the existing approaches focus on finding a …
has been extensively investigated. Most of the existing approaches focus on finding a …
Efficient progressive minimum k-core search
As one of the most representative cohesive subgraph models, k-core model has recently
received significant attention in the literature. In this paper, we investigate the problem of the …
received significant attention in the literature. In this paper, we investigate the problem of the …
Finding top-r influential communities under aggregation functions
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 …
that satisfy certain topology constraints, eg, degree constraints. The majority of existing …
Conflict-aware weighted bipartite b-matching and its application to e-commerce
C Chen, L Zheng, V Srinivasan… - … on Knowledge and …, 2016 - ieeexplore.ieee.org
The weighted bipartite b-matching problem (WBM) plays a significant role in many real-
world applications, including resource allocation, scheduling, Internet advertising, and E …
world applications, including resource allocation, scheduling, Internet advertising, and E …
On maximum degree‐based‐quasi‐clique problem: Complexity and exact approaches
G Pastukhov, A Veremyev, V Boginski… - …, 2018 - Wiley Online Library
We consider the problem of finding a degree‐based‐quasi‐clique of maximum cardinality in
a given graph for some fixed. A degree‐based‐quasi‐clique (often referred to as simply a …
a given graph for some fixed. A degree‐based‐quasi‐clique (often referred to as simply a …
ABC: attributed bipartite co-clustering
Finding a set of co-clusters in a bipartite network is a fundamental and important problem. In
this paper, we present the Attributed Bipartite Co-clustering (ABC) problem which unifies two …
this paper, we present the Attributed Bipartite Co-clustering (ABC) problem which unifies two …
Effective and efficient community search with size constraint on bipartite graphs
K Zhou, J Xin, J Chen, X Zhang, B Wang, Z Wang - Information Sciences, 2023 - Elsevier
Community search on bipartite graphs has been extensively studied in suspicious-group
detection and team formation. However, the existing studies focused on the cohesiveness of …
detection and team formation. However, the existing studies focused on the cohesiveness of …
Tight complexity bounds for FPT subgraph problems parameterized by the clique-width
We give tight algorithmic lower and upper bounds for some double-parameterized subgraph
problems when the clique-width of the input graph is one of the parameters. Let G be an …
problems when the clique-width of the input graph is one of the parameters. Let G be an …