Track Drawings of Graphs with Constant Queue NumberDi Giacomo, Emilio and Meijer, Henk (2004) Track Drawings of Graphs with Constant Queue Number. In: Graph Drawing 11th International Symposium, GD 2003, September 2124, 2003 , pp. 214225(Official URL: http://dx.doi.org/10.1007/9783540245957_20). Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/9783540245957_20
AbstractA ktrack drawing is a crossingfree 3D straightline drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a ktrack 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 wellknown 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.
Actions (login required)
