Volumes of 3D drawings of homogenous product graphs (extended abstract)

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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]. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Torok, L. (2005). Volumes of 3D drawings of homogenous product graphs (extended abstract). In Lecture Notes in Computer Science (Vol. 3381, pp. 423–426). Springer Verlag. https://doi.org/10.1007/978-3-540-30577-4_53

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free