Approaches for finding cohesive subgroups in large-scale social networks via maximum k-plex detection
Sign Up to like & getrecommendations! Published in 2017 at "Networks"
DOI: 10.1002/net.21745
Abstract: A k-plex is a clique relaxation introduced in social network analysis to model cohesive social subgroups that allows for a limited number of nonadjacent vertices (strangers) inside the cohesive subgroup. Several exact algorithms and heuristic… read more here.
Keywords: social networks; approaches finding; maximum plex; finding cohesive ... See more keywords