Webové rozhraní pro podporu úloh s překrývajícími se komunitami

Abstract

In networks exist densely connected groups of vertices, which we call communities. These are characteristic by their function. Finding them is important for understanding the structure and function of the network. Vertices from these communities can be in multiple communities at the same time. We will design and implement a web application to support and work with overlapping communities using the ego-zone algorithm. In addition to detecting communities, we will try to implement the tasks associated with this algorithm and then we will perform experiments on real and synthetic networks.