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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Leung, J., Vornberger, O., Witthoff, J.: On some variants of the bandwidth minimization problem. SIAM Journal on Computing 13(3), 650–667 (1984)
Bhatt, S.N., Thomson Leighton, F.: A framework for solving VLSI graph layout problems. Journal of Computer and System Sciences 28(2), 300–343 (1984)
Rosenberg, A.L., Snyder, L.: Bounds on the costs of data encodings. Theory of Computing Systems 12(1), 9–39 (1978)
Chung, F.R.K.: Labelings of graphs. In: Beineke, L.W., Wilson, R.J. (eds.) Selected Topics in Graph Theory, vol. 3, pp. 151–168. Academic Press (1988)
Hromkovič, J., Müller, V., Sýkora, O., Vrťo, I.: On Embedding Interconnection Networks into Rings of Processors. In: Etiemble, D., Syre, J.-C. (eds.) PARLE 1992. LNCS, vol. 605, pp. 51–62. Springer, Heidelberg (1992)
Papadimitriou, C.H.: The NP-completeness of the bandwidth minimization problem. Computing 16(3), 263–270 (1976)
Harper, L.: Optimal assignment of numbers to vertices. Journal of SIAM 12(1), 131–135 (1964)
Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Research Logistic Quarterly 2(1), 83–97 (1955)
Zhou, S.: Bounding the bandwidths for graphs. Theoretical Computer Science 249(2), 357–368 (2002)
de Klerk, E., Eisenberg-Nagy, M., Sotirov, R.: On semidefinite programming bounds for graph bandwidth. Technical report, Centrum Wiskunde & Informatica (2011)
Yuan, J., Zhou, S.: Optimal labelling of unit interval graphs. Applied Mathematics, A Journal of Chinese Universities 10B(3), 337–344 (1995)
Lam, P.C.B., Shiu, W.C., Chan, W.H.: Characterization of graphs with equal bandwidth and cyclic bandwidth. Discrete Mathematics 242(3), 283–289 (2002)
Lam, P.C.B., Shiu, W.C., Chan, W.H.: On bandwidth and cyclic bandwidth of graphs. Ars Combinatoria 47(3), 147–152 (1997)
Martí, R., Campos, V., Piñana, E.: A branch and bound algorithm for the matrix bandwidth minimization. European Journal of Operational Research 186(2), 513–528 (2008)
Palubeckis, G., Rubliauskas, D.: A branch-and-bound algorithm for the minimum cut linear arrangement problem. Journal of Combinatorial Optimization, 1–24 (2011), doi:10.1007/s10878–011–9406–2
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Romero-Monsivais, H., Rodriguez-Tello, E., Ramírez, G. (2013). A New Branch and Bound Algorithm for the Cyclic Bandwidth Problem. In: Batyrshin, I., Mendoza, M.G. (eds) Advances in Computational Intelligence. MICAI 2012. Lecture Notes in Computer Science(), vol 7630. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37798-3_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-37798-3_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37797-6
Online ISBN: 978-3-642-37798-3
eBook Packages: Computer ScienceComputer Science (R0)