A new branch and bound algorithm for the cyclic bandwidth problem

Authors:
Hillel Romero-Monsivais;Eduardo Rodriguez-Tello;Gabriel Ramírez
Affiliations:
Information Technology Laboratory, CINVESTAV-Tamaulipas, Victoria, Tamps., Mexico;Information Technology Laboratory, CINVESTAV-Tamaulipas, Victoria, Tamps., Mexico;Information Technology Laboratory, CINVESTAV-Tamaulipas, Victoria, Tamps., Mexico
Venue:
MICAI'12 Proceedings of the 11th Mexican international conference on Advances in Computational Intelligence - Volume Part II
Year:
2012

Citing 5
Cited 0

On some variants of the bandwidth minimization problem

SIAM Journal on Computing
Bounding the bandwidths for graphs

Theoretical Computer Science
Characterization of graphs with equal bandwidth and cyclic bandwidth

Discrete Mathematics
On Embedding Interconnection Networks into Rings of Processors

PARLE '92 Proceedings of the 4th International PARLE Conference on Parallel Architectures and Languages Europe
A branch-and-bound algorithm for the minimum cut linear arrangement problem

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Cyclic Bandwidth problem (CB) for graphs consists in labeling the vertices of a guest graph G by distinct vertices of a host cycle C (both of order n) in such a way that the maximum distance in the cycle between adjacent vertices in G is minimized. The CB problem arises in application areas like VLSI designs, data structure representations and interconnection networks for parallel computer systems. In this paper a new Branch and Bound (B&B) algorithm for the CB problem is introduced. Its key components were carefully devised after an in-depth analysis of the given problem. The practical effectiveness of this algorithm is shown through extensive experimentation over 20 standard graphs. The results show that the proposed exact algorithm attains the lower bounds for these graphs (of order n≤40) expending a reasonable computational time.