Abstract
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing is called the track number of G. In [9] it is proved that every graph from a proper minor closed family has constant track number if and only if it has constant queue number. In this paper we study the track number of well-known families of graphs with small queue number. For these families we show upper bounds and lower bounds on the track number that significantly improve previous results in the literature. Linear time algorithms that compute track drawings of these graphs are also presented and their volume complexity is discussed.
Research partially supported by “Progetto ALINWEB: Algoritmica per Internet e per il Web”, MIUR – PRIN. We thank Giuseppe Liotta for useful discussions on the subject of this paper.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Cornelsen, S., Schank, T., Wagner, D.: Drawing graphs on two and three lines. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 31–41. Springer, Heidelberg (2002)
Dujmović, V., Morin, P., Wood, D.: Pathwidth and three-dimensional straight line grid drawings of graphs. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 42–53. Springer, Heidelberg (2002)
Dujmović, V., Wood, D.: New results in graph layout. Technical Report TR-03-04, School of Computer Science, Carleton University (2003)
Dujmović, V., Wood, D.: Tree-partitions of k-trees with application in graph layout. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 205–217. Springer, Heidelberg (2003)
Felsner, S., Liotta, G., Wismath, S.: Straight line drawings on restricted integer grids in two and three dimensions. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 328–342. Springer, Heidelberg (2002)
Ganley, J.L.: Stack and queue layouts of Halin graphs (1995) (manuscript)
Halin, R.: Studies in minimally connected graphs. In: Combinatorial Mathematics and its Applications, New York, pp. 129–136. Academic Press, London (1971)
Heath, L.S., Rosenberg, A.L.: Laying out graphs using queues. SIAM J. Computing 21, 927–958 (1992)
Wood, D.: Queue layouts, tree-width, and three-dimensional graph drawing. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol. 2556, pp. 348–359. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Giacomo, E., Meijer, H. (2004). Track Drawings of Graphs with Constant Queue Number. In: Liotta, G. (eds) Graph Drawing. GD 2003. Lecture Notes in Computer Science, vol 2912. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24595-7_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-24595-7_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20831-0
Online ISBN: 978-3-540-24595-7
eBook Packages: Springer Book Archive