Communities in graphs and hypergraphs
Michael Brinkmeier, Jeremias Werner, Sven Recknagel · 2007
Abstract. In this paper we define a type of cohesive subgroups – called communities – in hypergraphs, based on the edge connectivity of subhy-pergraphs. We describe a simple algorithm for the construction of these sets and show, based on examples from image segmentation and infor-mation retrieval, that these groups may be useful for the analysis and accessibility of large graphs and hypergraphs. 1