Incremental Layout in DynaDAG

North, Stephen (1996) Incremental Layout in DynaDAG. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995 , pp. 409-418(Official URL: http://dx.doi.org/10.1007/BFb0021824).

Full text not available from this repository.

Abstract

Graph drawings are a basic component of user interfaces that display relationships between objects. Generating incrementally stable layouts is important for many applications. This paper describes DynaDAG, a new heuristic for incremental layout of directed acyclic graphs drawn as hierarchies, and its application in the DynaGraph system.

Item Type: Conference Paper
Additional Information: 10.1007/BFb0021824
Classifications: J Applications > J.999 Others
M Methods > M.300 Dynamic / Incremental / Online
G Algorithms and Complexity > G.999 Others
URI: http://gdea.informatik.uni-koeln.de/id/eprint/184

Actions (login required)

View Item View Item