Results 1 
4 of
4
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.
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.
Improved Symmetric Lists
, 2004
"... We introduce a new data structure called symlist based on an idea of Tarjan [17]. A symlist is a doubly linked list without any directional information encoded into its cells. In a symlist the two pointers in each cell have no fixed meaning like previous or next in standard lists. ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We introduce a new data structure called symlist based on an idea of Tarjan [17]. A symlist is a doubly linked list without any directional information encoded into its cells. In a symlist the two pointers in each cell have no fixed meaning like previous or next in standard lists.