Abstract
We prove exact cutwidths and bisection widths of ordinary, cylindrical and toroidal meshes. This answers an open problem in [9]. We also give upper bounds for cutwidths and bisection widths of many dimensional meshes. Furthemore, we show the exact cyclic cutwidth of 2-dimensional toroidal meshes and prove optimal upper and lower bounds for other meshes.
This research was partially supported by grant No. 2/1138/94 of Slovak Grant Agency and by EC Cooperative Action IC1000 “Algorithms for Future Technologies”; (Project ALTEC)
Partially supported by the Swiss National Science Foundation grant No. 20-40354-94
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Ahlswede, R., Bezrukov, S., Edge isoperimetric theorems for integer point arrays, Technical Report No. 94-064, University of Bielefeld, 1994.
Barth, D., Pellegrini, F., Raspaud, A., Roman, J., On bandwidth, cutwidth and quotient graphs, RAIRO Informatique, Théorique et Applications, to appear.
Bel Hala, A., Congestion optimale du plongement de l'ypercube H(n) dans la chaineP(2n), RAIRO Informatique, Théorique et Applications 27 (1993), 1–17.
Bollobás, B., Leader, I., Edge-isoperimetric inequalities in the grid, Combinatorica 11 (1991), 299–314.
Chung, F. R. K., Labelings of graphs, in: L.Beineke and R.Wilson eds., Selected Topics in Graph Theory 3, Academic Press, New York, 1988, 151–168.
Garey, M.R., Johnson, D.S., Stockmayer, L., Some simplified NP-complete graph problems, Theoretical Computer Science 1 (1976), 237–267.
Harper, L. H., Optimal assignment of number to vertices, J. Soc. Ind. Appl. Math. 12 (1964) 131–135.
Hart, S., A note on the edges of the n-cube, Discrete Mathematics 14 (1976), 157–163.
Leighton, F.T., Introduction to Parallel Algorithms and Architectures, Morgan Kaufmann, 1992.
Lengauer, T., Upper and lower bounds for the min-cut linear arrangement of trees, SIAM J. Algebraic and Discrete Methods 3 (1982), 99–113.
Lindsey II, J.H., Assignment of numbers to vertices, American Mathematical Monthly 7 (1964), 508–516.
Lopez, A.D., Law, H.F.S., A dense gate matrix layout method for MOS VLSI, IEEE Trans. Electron. Devices 27 (1980), 1671–1675.
Nakano, K., Linear layout of generalized hypercubes, in: Proc. 19th Intl. Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 790, Springer Verlag, Berlin, 1994, 364–375.
Nakano, K., Chen, W., Masuzawa, T., Hagihara, K., Tokura, N., Cutwidth and bisection width of hypercube graph, IEICE Transactions J73-A (1990), 856–862, (in Japanese).
Yannakakis, M., A polynomial algorithm for the Min Cut Linear Arrangement of trees, J. ACM 32 (1985), 950–988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rolim, J., Sýkora, O., Vrt'o, I. (1995). Optimal cutwidths and bisection widths of 2- and 3-dimensional meshes. In: Nagl, M. (eds) Graph-Theoretic Concepts in Computer Science. WG 1995. Lecture Notes in Computer Science, vol 1017. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60618-1_80
Download citation
DOI: https://doi.org/10.1007/3-540-60618-1_80
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60618-5
Online ISBN: 978-3-540-48487-5
eBook Packages: Springer Book Archive