Random Walk-based Community Key-members Search over Large Graphs

Yuxiang Wang, Yuyang Zhao, Xiaoliang Xu +3

Given a graph $G$, a query node $q$, and an integer $k$, community search (CS) seeks a cohesive subgraph (measured by community models such as $k$-core or $k$-truss) from $G$ that…