Results 1 
5 of
5
Stack And Queue Layouts Of Directed Acyclic Graphs: Part I
, 1996
"... . Stack layouts and queue layouts of undirected graphs have been used to model problems in fault tolerant computing and in parallel process scheduling. However, problems in parallel process scheduling are more accurately modeled by stack and queue layouts of directed acyclic graphs (dags). A stack ..."
Abstract

Cited by 26 (3 self)
 Add to MetaCart
. Stack layouts and queue layouts of undirected graphs have been used to model problems in fault tolerant computing and in parallel process scheduling. However, problems in parallel process scheduling are more accurately modeled by stack and queue layouts of directed acyclic graphs (dags). A stack layout of a dag is similar to a stack layout of an undirected graph, with the additional requirement that the nodes of the dag be in some topological order. A queue layout is defined in an analogous manner. The stacknumber (queuenumber) of a dag is the smallest number of stacks (queues) required for its stack layout (queue layout). In this paper, bounds are established on the stacknumber and queuenumber of two classes of dags: tree dags and unicyclic dags. In particular, any tree dag can be laid out in 1 stack and in at most 2 queues; and any unicyclic dag can be laid out in at most 2 stacks and in at most 2 queues. Forbidden subgraph characterizations of 1queue tree dags and 1queue cycle d...
Radial Level Planarity Testing and Embedding in Linear Time
 Journal of Graph Algorithms and Applications
, 2005
"... A graph with a given partition of the vertices on k concentric circles is radial level planar if there is a vertex permutation such that the edges can be routed strictly outwards without crossings. Radial level planarity extends level planarity, where the vertices are placed on k horizontal lines an ..."
Abstract

Cited by 19 (9 self)
 Add to MetaCart
A graph with a given partition of the vertices on k concentric circles is radial level planar if there is a vertex permutation such that the edges can be routed strictly outwards without crossings. Radial level planarity extends level planarity, where the vertices are placed on k horizontal lines and the edges are routed strictly downwards without crossings. The extension is characterised by rings, which are level nonplanar biconnected components. Our main results are linear time algorithms for radial level planarity testing and for computing an embedding. We introduce PQRtrees as a new data structure where Rnodes and associated templates for their manipulation are introduced to deal with rings. Our algorithms extend level planarity testing and embedding algorithms which use PQtrees.
Recognizing LeveledPlanar Dags in Linear Time
 In Proc. Graph Drawing, GD 1995, volume 1027 of LNCS
, 1996
"... this paper we present a linear time algorithm for the problem of determining if a given dag has a directed leveledplanar embedding. Our algorithm uses a variation of the PQtree data structure introduced by Booth and Lueker [2]. One motivation for our algorithm is that it can be extended to recogni ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
this paper we present a linear time algorithm for the problem of determining if a given dag has a directed leveledplanar embedding. Our algorithm uses a variation of the PQtree data structure introduced by Booth and Lueker [2]. One motivation for our algorithm is that it can be extended to recognize 1queue dags, thus answering an open question in [6]. Combinatorial and algorithmic results related to queue layouts of dags and posets can be found in [4, 7, 5]. Our algorithms also contrasts leveledplanar undirected graphs and leveledplanar dags, since the problem of recognizing leveledplanar graphs has been shown to be NPcomplete by Heath and Rosenberg [8]. Another motivation comes from the importance of the above problem in the area of graph drawing. Our result extends the work of Di Battista and Nardelli [1], Chandramouli and Diwan [3], and Hutton and Lubiw [9]. These authors assume solve the problem assuming certain restrictions on the given dag and leave the general problem open. The organization of the rest of the paper is as follows. Section 2 discusses the nature of the problem and outlines our approach. Section 3 defines the data
Track Planarity Testing and Embedding
 PROC. SOFTWARE SEMINAR: THEORY AND PRACTICE OF INFORMATICS, SOFSEM 2004
, 2004
"... A track graph is a graph with its vertex set partitioned into horizontal levels. It is track planar if there are permutations of the vertices on each level such that all edges can be drawn as weak monotone curves without crossings. The novelty and generalisation over level planar graphs is that ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
A track graph is a graph with its vertex set partitioned into horizontal levels. It is track planar if there are permutations of the vertices on each level such that all edges can be drawn as weak monotone curves without crossings. The novelty and generalisation over level planar graphs is that horizontal edges connecting consecutive vertices on the same level are allowed. We show that track planarity can be reduced to level planarity in linear time. Hence, there are time algorithms for the track planarity test and for the computation of a track planar embedding.
Clustered Level Planarity
 Proc. 30th Int. Conf. Current Trends in Theory and Practice of Computer Science (SOFSEMâ€™04
, 2004
"... Planarity is an important concept in graph drawing. It is generally accepted that planar drawings are well understandable. Recently, several variations of planarity have been studied for advanced graph concepts such as klevel graphs and clustered graphs. In klevel graphs, the vertices are partitio ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Planarity is an important concept in graph drawing. It is generally accepted that planar drawings are well understandable. Recently, several variations of planarity have been studied for advanced graph concepts such as klevel graphs and clustered graphs. In klevel graphs, the vertices are partitioned into k levels and the vertices of one level are drawn on a horizontal line. In clustered graphs, there is a recursive clustering of the vertices according to a given nesting relation. In this paper we combine the concepts of level planarity and clustering and introduce clustered klevel graphs. For connected clustered level graphs we show that clustered klevel planarity can be tested in O(kV) time.