Sciweavers

7 search results - page 1 / 2
» Coordinate Assignment for Cyclic Level Graphs
Sort
View
COCOON
2009
Springer
13 years 12 months ago
Coordinate Assignment for Cyclic Level Graphs
Abstract. The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, ...
Christian Bachmaier, Franz-Josef Brandenburg, Wolf...
GD
2008
Springer
13 years 6 months ago
Cyclic Leveling of Directed Graphs
Abstract. The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, ...
Christian Bachmaier, Franz-Josef Brandenburg, Wolf...
ESA
2008
Springer
130views Algorithms» more  ESA 2008»
13 years 7 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
ATMOS
2010
169views Optimization» more  ATMOS 2010»
13 years 3 months ago
Traffic Signal Optimization Using Cyclically Expanded Networks
Traditionally, the coordination of multiple traffic signals and the traffic assignment problem in an urban street network are considered as two separate optimization problems. How...
Ekkehard Köhler, Martin Strehler
COCOON
2005
Springer
13 years 11 months ago
Radial Coordinate Assignment for Level Graphs
We present a simple linear time algorithm for drawing level graphs with a given ordering of the vertices within each level. The algorithm draws in a radial fashion without changing...
Christian Bachmaier, Florian Fischer, Michael Fors...