Compressed representation of web and social networks via dense subgraphs

摘要: Mining and analyzing large web social networks are challenging tasks in terms of storage information access. In order to address this problem, several works have proposed compressing graphs allowing neighbor access over their compressed representations. paper, we propose a novel structure aiming reduce support efficient navigation graph Our approach uses clustering mining for finding dense subgraphs represents them using compact data structures. We perform experiments wide range compare our results with the best known techniques. show that improve state art space/time tradeoffs supporting queries. also enables queries based on subgraphs, such as cliques bicliques.