Exploring Communities in Large Profiled Graphs
Sign Up to like & getrecommendations! Published in 2019 at "IEEE Transactions on Knowledge and Data Engineering"
DOI: 10.1109/tkde.2018.2882837
Abstract: Given a graph $G$G and a vertex $q\in G$q∈G, the community search (CS) problem aims to efficiently find a subgraph of $G$G whose vertices are closely related to $q$q. Communities are prevalent in social and… read more here.
Keywords: profiled graphs; large profiled; communities large; exploring communities ... See more keywords