Understanding the structure, dynamics, and evolution of large graphs is becoming increasingly important in a variety of fields. The demand for visual tools to aid in this process is rising accordingly. Yet, many algorithms that create good representations of small and medium-sized graphs do not scale to larger graph sizes. The exploitation of the massive computational power provided by parallel...

We propose a layout algorithm for micro/macro graphs, i.e. relational structures with two levels of detail. While the micro-level graph is given, the macro-level graph is induced by a given partition of the micro-level vertices. A typical example is a social network of employees organized into different departments. We do not impose restrictions on the macro-level layout other than sufficient t...

Spatial layout problems aaect architects, physicists and many other professionals in their attempts to streamline factory designs, nd optimal molecular con-gurations or arrange components for micro-circuitry design. Although genetic algorithms have been used successfully in many of these areas, certain aspects of these problems still represent a major challenge for the GA community. This paper ...

Much of the research in facility layout has focused on static layouts where the material handling flow is assumed to be constant during the planning horizon. But in today’s market-based, dynamic environment, layout rearrangement may be required during the planning horizon to maintain layout effectiveness. A few algorithms have been proposed to solve this problem. They include dynamic programmin...

In this paper we present a generic algorithm for drawing sequences of graphs. This algorithm works for different layout algorithms and related metrics and adjustment strategies. It differs from previous work on dynamic graph drawing in that it considers all graphs in the sequence (offline) instead of just the previous ones (online) when computing the layout for each graph of the sequence. We in...

We consider the problem of (repeatedly) computing singlesource single-target shortest paths in large, sparse graphs. Previous investigations have shown the practical usefulness of geometric speed-up techniques that guarantee the correctness of the result for shortest-path computations. However, such speed-up techniques utilize a layout of the graph which typically comes from geographic informat...

Standard cell layouts may need only slight modifications to meet timing constraints. In these situations, general purpose algorithms, which consider numerous parameters of the layout, may be too time consuming or too coarse to make the changes where needed. This paper presents an incremental timing driven placement algorithm designed to “cleanup” a handful of critical paths in a previously plac...

The layout of chemical plants has to take into consideration boundary conditions and requirements of many different engineering fields. In order to assist the design engineer at an early stage during the extended basic engineering, a system for computer aided plant design has been developed. It contains modules for •extended equipment models including equipment related piping and areas for main...

Purpose – In spite of having a number of general-purpose algorithms for solving plant layout problems, facility planners may still face a challenging task to adjust these algorithms to handle special, but not uncommon, layout problems. The purpose of this study is to propose a new method for addressing the impact of overhead space utilization on a plant layout solution. Design/methodology/appro...