activity
20132026
most citedFinding Global Homophily in Graph Neural Networks When Meeting Heterophily

38 citations · 77 across the 9 of their papers we have counts for

collaborators
Showing cs.SIShow all

2 papers · 1 filter

cs.SI2025

Finding Near-Optimal Maximum Set of Disjoint -Cliques in Real-World Social Networks

Wenqing Lin, Xin Chen, Haoxuan Xie +2

A -clique is a dense graph, consisting of fully-connected nodes, that finds numerous applications, such as community detection and network analysis. In this paper, we study…

cs.SI2022★ 26 cited

DMCS : Density Modularity based Community Search

Junghoon Kim, Siqiang Luo, Gao Cong +1

Community Search, or finding a connected subgraph (known as a community) containing the given query nodes in a social network, is a fundamental problem. Most of the existing commun…