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

摘要

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.