Relabeling nodes according to the structure of the graph

Abstract : In this paper we introduce a new algorithm to find a approximate solution for cyclic bandwidth sum problem (CBSP). This problem consists in a minimization of the sum of the distances in the numbering between pairs of vertices connected by a edge. A method based on a depth-first search is proposed where the order in which the nodes are traversed depends on a criterion based on the the Jaccard index between the current node and its neighbors. This method is faster and more effective than the other available heuristics.
Liste complète des métadonnées
Contributeur : Ronan Hamon <>
Soumis le : mardi 29 octobre 2013 - 15:34:58
Dernière modification le : jeudi 19 avril 2018 - 14:54:04
Document(s) archivé(s) le : vendredi 7 avril 2017 - 18:39:01


Fichiers produits par l'(les) auteur(s)


  • HAL Id : ensl-00878041, version 1


Ronan Hamon, Céline Robardet, Pierre Borgnat, Patrick Flandrin. Relabeling nodes according to the structure of the graph. 2013. 〈ensl-00878041〉



Consultations de la notice


Téléchargements de fichiers