Relabeling nodes according to the structure of the graph - Archive ouverte HAL Access content directly
Reports Year :

Relabeling nodes according to the structure of the graph

(1) , (2) , (1) , (1)
1
2

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.
Fichier principal
Vignette du fichier
relabeling.pdf (138.96 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

ensl-00878041 , version 1 (29-10-2013)

Identifiers

  • HAL Id : ensl-00878041 , version 1

Cite

Ronan Hamon, Céline Robardet, Pierre Borgnat, Patrick Flandrin. Relabeling nodes according to the structure of the graph. 2013. ⟨ensl-00878041⟩
132 View
81 Download

Share

Gmail Facebook Twitter LinkedIn More