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.

[1]  J. Tolson,et al.  Extension of the Pelz Effect: The Impact of Leader's Upward Influence on Group Members' Control Within the Organization , 1990 .

[2]  Mikhail J. Atallah,et al.  Algorithms and Theory of Computation Handbook , 2009, Chapman & Hall/CRC Applied Algorithms and Data Structures series.

[3]  R. Wunderer.  Führung und Zusammenarbeit : Beiträge zu einer unternehmerischen Führungslehre , 1997 .

[4]  G. Graen,et al.  Effects of Linking-Pin Quality on the Quality of Working Life of Lower Participants. , 1977 .

[5]  Edward M. Reingold,et al.  Tidier Drawings of Trees , 1981, IEEE Transactions on Software Engineering.

[6]  R. Likert,et al.  New Patterns of Management. , 1963 .

[7]  B. Bass,et al.  Transformational Leadership and the Falling Dominoes Effect , 1987 .

[8]  Peter Eades,et al.  Graph drawing algorithms , 2010 .

[9]  R. Insinga,et al.  Revisiting the relationship of supervisor trust and CEO trust to turnover intentions: A three-country comparative study , 2011 .

[10]  S. Green,et al.  In the shadow of the boss's boss: effects of supervisors' upward exchange relationships on employees. , 2007, The Journal of applied psychology.

[11]  R. Martí,et al.  A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs , 1996 .

[12]  W. T. Tutte.  How to Draw a Graph , 1963 .

[13]  Emden R. Gansner,et al.  Improved Force-Directed Layouts , 1998, GD.

[14]  Xuemin Lin,et al.  How to draw a directed graph , 1989, [Proceedings] 1989 IEEE Workshop on Visual Languages.

[15]  János Pach,et al.  How to draw a planar graph on a grid , 1990, Comb..

[16]  Peter Eades,et al.  Fixed edge-length graph drawing is NP-hard , 1990, Discret. Appl. Math..

[17]  Roberto Tamassia,et al.  On Embedding a Graph in the Grid with the Minimum Number of Bends , 1987, SIAM J. Comput..

[18]  Donald C. Pelz,et al.  Influence: a key to effective leadership in the first-line supervisor. , 1952 .