Efficient and effective community search on large-scale bipartite graphs

K Wang, W Zhang, X Lin, Y Zhang… - 2021 IEEE 37th …, 2021 - ieeexplore.ieee.org
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 …

Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs

K Wang, X Lin, L Qin, W Zhang, Y Zhang - The VLDB Journal, 2022 - Springer
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 …

Cohesive subgraph search over big heterogeneous information networks: Applications, challenges, and solutions

Y Fang, K Wang, X Lin, W Zhang - Proceedings of the 2021 International …, 2021 - dl.acm.org
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 …

Efficient personalized maximum biclique search

K Wang, W Zhang, X Lin, L Qin… - 2022 IEEE 38th …, 2022 - ieeexplore.ieee.org
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 …

Efficiently answering reachability and path queries on temporal bipartite graphs

X Chen, K Wang, X Lin, W Zhang, L Qin… - Proceedings of the …, 2021 - opus.lib.uts.edu.au
Bipartite graphs are naturally used to model relationships between two different types of
entities, such as people-location, authorpaper, and customer-product. When modeling real …

Accelerated butterfly counting with vertex priority on bipartite graphs

K Wang, X Lin, L Qin, W Zhang, Y Zhang - The VLDB Journal, 2023 - Springer
Bipartite graphs are of great importance in many real-world applications. Butterfly, which is a
complete 2× 2 biclique, plays a key role in bipartite graphs. In this paper, we investigate the …

Distributed (α, β)-core decomposition over bipartite graphs

Q Liu, X Liao, X Huang, J Xu… - 2023 IEEE 39th …, 2023 - ieeexplore.ieee.org
(α, β)-core is an important cohesive subgraph model for bipartite graphs. Given a bipartite
graph G, the problem of (α, β)-core decomposition is to compute non-empty (α, β)-cores for …

Pareto-optimal community search on large bipartite graphs

Y Zhang, K Wang, W Zhang, X Lin… - Proceedings of the 30th …, 2021 - dl.acm.org
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 …

Cohesive subgraph discovery over uncertain bipartite graphs

K Wang, G Zhao, W Zhang, X Lin… - … on Knowledge and …, 2023 - ieeexplore.ieee.org
In this article, we propose the-core model, which is the first cohesive subgraph model on
uncertain bipartite graphs. To capture the uncertainty of relationships/edges,-degree is …

Experimental analysis and evaluation of cohesive subgraph discovery

D Kim, S Kim, J Kim, J Kim, K Feng, S Lim, J Kim - Information Sciences, 2024 - Elsevier
Retrieving cohesive subgraphs in networks is a fundamental problem in social network
analysis and graph data management. These subgraphs can be used for marketing …