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...

ODL for visualising large network topologies. The main contribution of our algorithm is to simplify the layout problem by separating the nodes in the network into multiple hierarchical layers based on the outdegree of each node. Our algorithm is designed to exploit the underlying structure of power-law topologies, which occur in a wide variety of practical network applications. However, the use...

Consider the problem of automatically generating layouts for state diagrams (statecharts). Such diagrams appear in automation engeneering and CASE tools. Automatic layout of these diagrams leads to better understanding and saves time spend on their development. State diagram layout problem seems to have some differences from general graph layout problem. In this article adaptation of two graph ...

In this paper we introduce two novel algorithms for drawing sequences of orthogonal and hierarchical graphs while preserving the mental map. Both algorithms can be parameterized to trade layout quality for dynamic stability. In particular, we had to develop new metrics which work upon the intermediate results of layout phases. We discuss some properties of the resulting animations by means of e...

Many algorithms address the problem of rendering an abstract graph structure as a diagram in as efficient and as elegant a manner as possible. The criteria for judging the worth of these algorithms are typically the extent to which they conform to common aesthetic criteria (e.g. minimising the number of crossings, maximising symmetry), or their computational efficiency. The algorithms are not u...