Abstract
3-dimensional layout of graphs is a standard model for orthogonal graph drawing. Vertices are mapped into the 3D grid and edges are drawn as the grid edge disjoint paths. The main measure of the efficiency of the drawing is the volume which is motivated by the 3D VLSI design. In this paper we develop a general framework for efficient 3D drawing of product graphs in both 1 active layer and general model. As a consequence we obtain several optimal drawings of product graphs when the factor graphs represent typical networks like CCC, Butterfly, star graph, De Bruijn... This is an analogue of a similar work done by Fernandez and Efe [2] for 2D drawings using a different approach. On the other hand our results are generalizations of the optimal 3D drawings of hypercubes [9].
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
Yeh, C.-H., Parhami, B.: VLSI layouts of complete graphs and star graphs. IPL 68, 39–45 (1998)
Fernandez, A., Efe, K.: Efficient VLSI layouts for homogenous product networks. IEEE Transactions on Computers 46, 1070–1082 (1997)
Ginette, G.: Edge Forwarding Index of Cayley Graphs and Star Graphs. Discrete Applied Mathematics 80, 149–160 (1997)
Heydeman, M.C., Meyer, J.C., Sotteau, D.: On forwarding indices of networks. Discrete Applied Mahtematics 23, 103–123 (1989)
Leighton, F.T., Rosenberg, A.L.: Three-dimensional circuit layouts. SIAM Journal on Computing 15, 793–813 (1986)
Raspaud, A., Sýkora, O., Vrťo, I.: Cutwidth of the de Bruijn graph. RAIRO 26, 509–514 (1995)
Shahrokhi, F., Szekely, L.A.: An algebraic approach to the uniform concurrent multicommodity flow problem: Theory and applications. Technical report CRPDC-91-4, DCS, Uni. North texas, Denton (1991)
Stacho, L., Vrťo, I.: Bisection width of transposition graphs. Discrete Applied Mathematics 84, 221–235 (1998)
Torok, L., Vrťo, I.: Layout volumes of the hypercube. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 414–424. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Torok, L. (2005). Volumes of 3D Drawings of Homogenous Product Graphs. In: Vojtáš, P., Bieliková, M., Charron-Bost, B., Sýkora, O. (eds) SOFSEM 2005: Theory and Practice of Computer Science. SOFSEM 2005. Lecture Notes in Computer Science, vol 3381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30577-4_53
Download citation
DOI: https://doi.org/10.1007/978-3-540-30577-4_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24302-1
Online ISBN: 978-3-540-30577-4
eBook Packages: Computer ScienceComputer Science (R0)