Capturing the regular structure in the artificially generated graph. This graph (disregarding the color) represents the binary graph from the first example of the article. The graph, which is mainly random, contains a complete bipartite sub-graph K25,25. This highly structured sub-graph, highlighted in the figure, was successfully detected by the set-complexity-based approach. The two modules of the K25,25graph are shown in red and blue.