Sciweavers

2 search results - page 1 / 1
» Linear Time Planarity Testing and Embedding of Strongly Conn...
Sort
View
ESA
2008
Springer
130views Algorithms» more  ESA 2008»
13 years 6 months ago
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
Christian Bachmaier, Wolfgang Brunner
GD
2003
Springer
13 years 9 months ago
Radial Level Planarity Testing and Embedding in Linear Time
A graph with an ordered k-partition of the vertices is radial level planar if there is a strictly outward drawing on k concentric levels without crossings. Radial level planarity ...
Christian Bachmaier, Franz-Josef Brandenburg, Mich...