Results 11 
17 of
17
New Results in Graph Layout
 School of Computer Science, Carleton Univ
, 2003
"... A track layout of a graph consists of a vertex colouring, an edge colouring, and a total order of each vertex colour class such that between each pair of vertex colour classes, there is no monochromatic pair of crossing edges. This paper studies track layouts and their applications to other models o ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
A track layout of a graph consists of a vertex colouring, an edge colouring, and a total order of each vertex colour class such that between each pair of vertex colour classes, there is no monochromatic pair of crossing edges. This paper studies track layouts and their applications to other models of graph layout. In particular, we improve on the results of Enomoto and Miyauchi [SIAM J. Discrete Math., 1999] regarding stack layouts of subdivisions, and give analogous results for queue layouts. We solve open problems due to Felsner, Wismath, and Liotta [Proc. Graph Drawing, 2001] and Pach, Thiele, and Toth [Proc. Graph Drawing, 1997] concerning threedimensional straightline grid drawings. We initiate the study of threedimensional polyline grid drawings and establish volume bounds within a logarithmic factor of optimal.
The Pagenumber of Genus g Graphs is 0(g)
, 1992
"... In 1979, Bernhart and Kainen conjectured that graphs of fixed genus g> 1 have unbounded pagenumber. In this paper. it is proven that genus g graphs can be embedded in 0(g) pages, thus disproving the conjecture. An 0 ( fi) lower bound is also derwed. The first algorithm in the literature for embe ..."
Abstract
 Add to MetaCart
In 1979, Bernhart and Kainen conjectured that graphs of fixed genus g> 1 have unbounded pagenumber. In this paper. it is proven that genus g graphs can be embedded in 0(g) pages, thus disproving the conjecture. An 0 ( fi) lower bound is also derwed. The first algorithm in the literature for embedding an arbitra ~ graph in a book with a nontrlwal upper bound on the number of pages M presented. First, the algorithm computes the genus g of a graph using the algorithm of Filotti, Miller, Reif ( 1979), which is polynomialtime for fixed genus. Second, it applies an optimaltime algorithm for obtaining an 0 ( g)page book embedding. Separate book embedding algorithms are given for the cases of graphs embedded m orlentable and nonorientable surfaces. An important aspect of the construction is a new decomposition theorem, of independent interest, for a graph embedded on a surface. Book embedding has application in several areas, two of which are directly related to the results obtained: faulttolerant VLSI and complexity theory,
Monotone expanders constructions and applications
"... The main purpose of this work is to formally define monotone expanders and motivate their study with (known and new) connections to other graphs and to several computational and pseudorandomness problems. In particular we explain how monotone expanders of constant degree lead to: 1. Constant degree ..."
Abstract
 Add to MetaCart
The main purpose of this work is to formally define monotone expanders and motivate their study with (known and new) connections to other graphs and to several computational and pseudorandomness problems. In particular we explain how monotone expanders of constant degree lead to: 1. Constant degree dimension expanders in finite fields, resolving a question of [BISW04]. 2. O(1)page and O(1)pushdown expanders, resolving a question of [GKS86], and leading to tight lower bounds on simulation time for certain Turing Machines. Bourgain [Bou09] gave recently an ingenious construction of such constant degree monotone expanders. The first application (1) above follows from a reduction in [DS08]. We give a short exposition of both construction and reduction. The new contributions of this paper are simple. First, we explain the observation leading to the second application (2) above, and some of its consequences. Second, we observe that a variant of the zigzag graph product preserves monotonicity, and use it to give a simple alternative construction of monotone expanders, with nearconstant degree. 1
Stacks, Queues and Tracks: Layouts of Graph Subdivisions
, 2005
"... A kstack layout (respectively, kqueue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of noncrossing (nonnested) edges with respect to the vertex ordering. A ktrack layout of a graph consists of a vertex kcolouring, and a total order of ea ..."
Abstract
 Add to MetaCart
(Show Context)
A kstack layout (respectively, kqueue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of noncrossing (nonnested) edges with respect to the vertex ordering. A ktrack layout of a graph consists of a vertex kcolouring, and a total order of each vertex colour class, such that between each pair of colour classes no two edges cross. The stacknumber (respectively, queuenumber, tracknumber) of a graph G, denoted by sn(G) (qn(G), tn(G)), is the minimum k such that G has a kstack (kqueue, ktrack) layout. This paper studies stack, queue, and track layouts of graph subdivisions. It is known that every graph has a 3stack subdivision. The best known upper bound on the number of division vertices per edge in a 3stack subdivision of an nvertex graph G is improved from O(log n) to O(log min{sn(G), qn(G)}). This result reduces the question of whether queuenumber is bounded by stacknumber to whether 3stack graphs have bounded queue number. It is proved that every graph has a 2queue subdivision, a 4track subdivision, and a mixed 1stack 1queue subdivision. All these values are optimal for every nonplanar graph. In addition, we characterise those graphs with kstack, kqueue, and ktrack subdivisions, for all values of k. The number of division vertices per edge in the case of 2queue and 4track subdivisions, namely O(log qn(G)), is optimal to within a constant factor, for every graph G. Applications to 3D polyline grid drawings are presented. For example, it is proved that every graph G has a 3D polyline grid drawing with the vertices on a rectangular prism, and with O(log qn(G)) bends per edge. Finally, we
1.1 Stack and Queue Layouts................................ 3
, 2003
"... A track layout of a graph consists of a vertex colouring, an edge colouring, and a total order of each vertex colour class such that between each pair of vertex colour classes, there is no monochromatic pair of crossing edges. This paper studies track layouts and their applications to other models ..."
Abstract
 Add to MetaCart
(Show Context)
A track layout of a graph consists of a vertex colouring, an edge colouring, and a total order of each vertex colour class such that between each pair of vertex colour classes, there is no monochromatic pair of crossing edges. This paper studies track layouts and their applications to other models of graph layout. In particular, we improve on the results of Enomoto and Miyauchi [SIAM J. Discrete Math., 1999] regarding stack layouts of subdivisions, and give analogous results for queue layouts. We solve open problems due to Felsner, Wismath, and Liotta
0 k
"... Science has marched on despite the appearance of the original \Figures of Merit " [18]. The purpose of this survey is to bring the community up to date on the most recent bounds, so that we may collaborate to improve them. 1 The Spotlight Factor Recall the denition of the spotlight factor for r ..."
Abstract
 Add to MetaCart
Science has marched on despite the appearance of the original \Figures of Merit " [18]. The purpose of this survey is to bring the community up to date on the most recent bounds, so that we may collaborate to improve them. 1 The Spotlight Factor Recall the denition of the spotlight factor for rst authors: De nition: In a collaboration of alphabetized coauthors X 0