A method for detecting communities in a radio access network of a mobile telecom network with a plurality of vertices (C, BBU) referring to cells, baseband units or other types of entities of the radio access network, wherein the method comprises: - calculating (S11) relationship strengths for network connections between the vertices (C, BBU) by executing a connection strength calculation process by analyzing performance factors, decisive for radio access network performance; - creating (S12) a network graph with nodes, representing the vertices (C, BBU) in the radio access network and edges, representing the network connections based on the calculated relationship strengths ; - applying (S13) an extended iterative disjoint community detection algorithm for clustering nodes into communities, wherein in each iteration imposed one or more constraints for clustering nodes into the same community are analyzed (S14), wherein the extended iterative disjoint community detection algorithm allows to impose different constraints and wherein the nodes are at least of a first type and a second type and wherein a node of the second type comprises or is connectable to multiple nodes of the first type and a node of the first type cannot belong to multiple nodes of the second type and wherein the extended iterative disjoint community detection algorithm is firstly applied (S23) to nodes of the first type (C) to provide an intermediate result with communities of nodes of the first type, wherein the intermediate result serves as input for secondly applying (S24) the extended iterative disjoint community detection algorithm to the nodes of the second type (BBU); and - clustering those of the nodes of the first type and those of the nodes of the second type into communities of a first and second type, respectively, for which the constraints are fulfilled. - calculating (S11) relationship strengths for network connections between the vertices (C, BBU) by executing a connection strength calculation process by analyzing performance factors, decisive for radio access network performance; - creating (S12) a network graph with nodes, representing the vertices (C, BBU) in the radio access network and edges, representing the network connections based on the calculated relationship strengths ; - applying (S13) an extended iterative disjoint community detection algorithm for clustering nodes into communities, wherein in each iteration imposed one or more constraints for clustering nodes into the same community are analyzed (S14), wherein the extended iterative disjoint community detection algorithm allows to impose different constraints and wherein the nodes are at least of a first type and a second type and wherein a node of the second type comprises or is connectable to multiple nodes of the first type and a node of the first type cannot belong to multiple nodes of the second type and wherein the extended iterative disjoint community detection algorithm is firstly applied (S23) to nodes of the first type (C) to provide an intermediate result with communities of nodes of the first type, wherein the intermediate result serves as input for secondly applying (S24) the extended iterative disjoint community detection algorithm to the nodes of the second type (BBU); and - clustering those of the nodes of the first type and those of the nodes of the second type into communities of a first and second type, respectively, for which the constraints are fulfilled. <EOS>