A hierarchical tree layout algorithm with an application to corporate management in a change process

Authors:
Vera Hofer;Georg Krempl
Affiliations:
Department of Statistics and Operations Research, University of Graz, Universitätsstraíe 15/E3, 8010 Graz, Austria;Knowledge Management and Discovery Group, Otto-von-Guerike University, POB 4120, 39016 Magdeburg, Germany
Venue:
Expert Systems with Applications: An International Journal
Year:
2012

Citing 4
Cited 0

On embedding a graph in the grid with the minimum number of bends

SIAM Journal on Computing
Fixed edge-length graph drawing is NP-hard

Discrete Applied Mathematics
Improved Force-Directed Layouts

GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Tidier Drawings of Trees

IEEE Transactions on Software Engineering

Quantified Score

Hi-index	12.05

Visualization

Abstract

This work presents a hierarchical tree layout algorithm based on iterative rearrangement of subtrees. Using a greedy heuristic, all subtrees of a common parent are rearranged into a forest such that gaps between them are minimized. This heuristic is used to build a rearranged tree from bottom-up, starting with forests of the single leafs, and ending with the complete tree. Different cost measures for arrangement operations are discussed, which are based on the shape of a subtree. This shape can be characterized by the subtree's leftmost and rightmost vertices, which determine how gapless this subtree can be combined with another one. The layout algorithm is used to display an organisational hierarchy. Such a hierarchical layout aids leadership when organisational structures are complex. In particular, it can be used to monitor the performance of organisational units undergoing change, e.g. restructuring. This improves the effectiveness of leadership instruments.