We survey computational approaches and solutions for discovering locally dense groups in social and complex networks. A graph-theoretical property is local if it is definable over subgraphs induced by the groups only. In this context, we discuss perfectly dense groups (cliques), structurally dense groups (plexes, cores), and statistically dense groups (N-dense groups). We give algorithms (and hardness results) for fundamental issues such as for finding subgroups of certain sizes or for enumerating meaningful subgroups.     «

We survey computational approaches and solutions for discovering locally dense groups in social and complex networks. A graph-theoretical property is local if it is definable over subgraphs induced by the groups only. In this context, we discuss perfectly dense groups (cliques), structurally dense groups (plexes, cores), and statistically dense groups (N-dense groups). We give algorithms (and hardness results) for fundamental issues such as for finding subgroups of certain sizes or for enumerati...     »