Relabelling vertices according to the network structure by minimizing the cyclic bandwidth sum

International audienceGetting a labelling of vertices close to the structure of the graph has been proved to be of interest in many applications, e.g. to follow signals indexed by the vertices of the network. This question can be related to a graph labelling problem known as the cyclic bandwidth sum problem (CBSP). It consists of finding a labelling of the vertices of an undirected and unweighted graph with distinct integers such that the sum of (cyclic) difference of labels of adjacent vertices is minimized. In this paper, we introduce a new heuristic to follow the structure of the graph, by finding an approximate solution for the CBSP. Although theoretical results exist that give optimal value of cyclic bandwidth sum (CBS) for standard graphs, there are neither results for real-world complex networks, nor explicit methods to reach this optimal result. Furthermore, only a few methods have been proposed to approximately solve this problem. The heuristic we propose is a two-step algorithm: the first step consists of traversing the graph to find a set of paths which follow the structure of the graph, using a similarity criterion based on the Jaccard index to jump from one vertex to the next one. The second step is the merging of all obtained paths, based on a greedy approach that extends a partial solution by inserting a new path at the position that minimizes the CBS. The effectiveness of the proposed heuristic is shown through experiments on graphs whose optimal value of CBS is known, as well as on complex networks, where the consistency between labelling and topology is highlighted