A New Measure for the Bandwidth Minimization Problem

Jose Torres-JimenezEduardo Rodriguez-Tello

The Bandwidth Minimization Problem for Graphs (BMPG) can be defined as finding a labeling for the vertices of a graph, where the maximum absolute difference between labels of each pair of connected vertices is minimum. The most used measure for the BMPG algorithms is, that indicates only the maximum of all absolute differences. In order to test the performance of and a stochastic search procedure based on a Simulated Annealing (SA) algorithm has been applied to solve the BMPG. The experiments show that the SA that uses has better results for many classes of graphs than the one that uses

Caso o link acima esteja inválido, faça uma busca pelo texto completo na Web: Buscar na Web

Biblioteca Digital Brasileira de Computação - Contato:
     Mantida por: