Benutzer: Gast  Login
Titel:

Local Density

Dokumenttyp:
Technical Report
Autor(en):
Sven Kosub
Abstract:
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...     »
Stichworte:
Computational complexity; enumerative algorithms; approximation algorithms; graph algorithms; cliques
Jahr:
2004
Jahr / Monat:
2004-12-01 00:00:00
Seiten/Umfang:
31
 BibTeX