Algorithms for multi-level graph planarity testing and layout
نویسندگان
چکیده
منابع مشابه
Testing Cyclic Level and Simultaneous Level Planarity
In this paper we prove that testing the cyclic level planarity of a cyclic level graph is a polynomial-time solvable problem. This is achieved by introducing and studying a generalization of this problem, which we call cyclic T -level planarity. Moreover, we show a complexity dichotomy for testing the simultaneous level planarity of a set of level graphs, with respect to both the number of leve...
متن کاملAlgorithms for string and graph layout
Many graph optimization problems can be viewed as graph layout problems. A layout of a graph is a geometric arrangement of the vertices subject to given constraints. For example, the vertices of a graph can be arranged on a line or a circle, on a twoor three-dimensional lattice, etc. The goal is usually to place all the vertices so as to optimize some specified objective function. We develop co...
متن کاملCyclic Level Planarity Testing and Embedding
In this paper we introduce cyclic level planar graphs, which are a planar version of the recurrent hierarchies from Sugiyama et al. [8] and the cyclic extension of level planar graphs, where the first level is the successor of the last level. We study the testing and embedding problem and solve it for strongly connected graphs in time O(|V | log |V |).
متن کاملCoarse Grained Parallel Graph Planarity Testing
We present a coarse grained parallel algorithm for planarity testing and planar embedding. The algorithm requires O(log p) communication rounds and linear sequential work per round. It assumes that the local memory per processor, N=p, is larger than p for some xed > 0. This assumption is true for all commercially available multiprocessors. Our result implies a BSP algorithm with O(log p) supers...
متن کاملLevel Planarity Testing in Linear Time
In a leveled directed acyclic graph G = (V, E) the vertex set V is partitioned into k ≤ |V | levels V1, V2, . . . , Vk such that for each edge (u, v) ∈ E with u ∈ Vi and v ∈ Vj we have i < j. The level planarity testing problem is to decide if G can be drawn in the plane such that for each level Vi, all v ∈ Vi are drawn on the line li = {(x, k−i) | x ∈ R}, the edges are drawn monotone with resp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.02.033