Core decomposition in multilayer networks: Theory, algorithms, and applications

E Galimberti, F Bonchi, F Gullo… - ACM Transactions on …, 2020 - dl.acm.org
Multilayer networks are a powerful paradigm to model complex systems, where multiple
relations occur between the same entities. Despite the keen interest in a variety of tasks …

Size-constrained community search on large networks: An effective and efficient solution

F Zhang, H Guo, D Ouyang, S Yang… - IEEE Transactions on …, 2023 - ieeexplore.ieee.org
As a fundamental graph problem, community search is applied in various areas, eg, social
networks, the world wide web, and biology. A common requirement from real applications is …

CCSS: Towards conductance-based community search with size constraints

Y He, L Lin, P Yuan, R Li, T Jia, Z Wang - Expert Systems with Applications, 2024 - Elsevier
Size-constrained community search, retrieving a size-bounded high-quality subgraph
containing user-specified query vertices, has been extensively studied in graph analysis …

Finding influential communities in massive networks

RH Li, L Qin, JX Yu, R Mao - The VLDB Journal, 2017 - Springer
Community search is a problem of finding densely connected subgraphs that satisfy the
query conditions in a network, which has attracted much attention in recent years. However …

Influence propagation model for clique-based community detection in social networks

N Alduaiji, A Datta, J Li - IEEE Transactions on Computational …, 2018 - ieeexplore.ieee.org
Social media community detection is a fundamental challenge in social data analytics, in
order to understand user relationships and improve social recommendations. Although the …

Reliable community search in dynamic networks

Y Tang, J Li, NAH Haldar, Z Guan, J Xu… - arXiv preprint arXiv …, 2022 - arxiv.org
Searching for local communities is an important research problem that supports advanced
data analysis in various complex networks, such as social networks, collaboration networks …

Discovering significant communities on bipartite graphs: An index-based approach

K Wang, W Zhang, Y Zhang, L Qin… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
Bipartite graphs are widely used to model relationships between two types of entities.
Community search retrieves densely connected subgraphs containing a query vertex, which …

[PDF][PDF] Efficient community search over large directed graphs: An augmented index-based approach

Y Chen, J Zhang, Y Fang, X Cao, I King - Proceedings of the Twenty-Ninth …, 2021 - ijcai.org
Given a graph G and a query vertex q, the topic of community search (CS), aiming to retrieve
a dense subgraph of G containing q, has gained much attention. Most existing works focus …

Querying minimal steiner maximum-connected subgraphs in large graphs

J Hu, X Wu, R Cheng, S Luo, Y Fang - … of the 25th ACM International on …, 2016 - dl.acm.org
Given a graph G and a set Q of query nodes, we examine the Steiner Maximum-Connected
Subgraph (SMCS). The SMCS, or G's induced subgraph that contains Q with the largest …

Modeling hereditary disease behavior using an innovative similarity criterion and ensemble clustering

M Mojarad, F Sarhangnia, A Rezaeipanah… - Current …, 2021 - ingentaconnect.com
Background: Today, there are various theories about the causes of hereditary diseases, but
doctors believe that both genetic and environmental factors play an essential role in the …