A New Measure for the Bandwidth Minimization Problem
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.
After analyzing some drawbacks of β, a measure, calledγ, which uses a positional numerical system with variable base and takes into account all the absolute differences of a graph is given.
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 β.
KeywordsBandwidth Metric Bandwidth Minimization Problem Graphs Simulated Annealing
Unable to display preview. Download preview PDF.
- 5.Harary, F.: Theory of graphs and its aplications. Czechoslovak Academy of Science, Prague (1967) 161Google Scholar
- 6.Torres-Jiménez, J.: Minimización del Ancho de Banda de un Grafo Usando un Algoritmo Genético. Ph. D. ITESM-Mor., México (1997)Google Scholar
- 10.Cuthill, E., McKee, J.: Reducing the bandwidth of sparse symmetric matrices. Proceedings 24th National of the ACM (1969) 157–172Google Scholar
- 12.George, A., Liu, W.: Computer Solution of Large Sparse Positive Definite Systems. Prentice Hall, Englewood Cliffs, NJ (1981)Google Scholar
- 14.Dueck, G., Jeffs, J.: A Heuristic Bandwidth Reduction Algorithm. J. of Comb. Math. and Comp. 18 (1995)Google Scholar
- 15.Esposito, A., Fiorenzo, S., Malucelli, F., Tarricone, L.: A wonderful bandwidth matrix reduction algorithm. Submitted to Operations Research LettersGoogle Scholar
- 17.Spears, W.M.: Simulated Annealing for hard satisfiability problems. AI Center, Naval Research Laboratory, Washington, DC 20375 AIC-93-015 (1993)Google Scholar