首页 | 本学科首页   官方微博 | 高级检索  
     


A hierarchical tree layout algorithm with an application to corporate management in a change process
Authors:Vera Hofer  Georg Krempl
Affiliation:1. Division of General Academic Pediatrics, Department of Pediatrics, MassGeneral Hospital for Children, Boston, MA, USA;2. Department of Internal Medicine, Massachusetts General Hospital, Boston, MA, USA;3. Harvard Medical School, Boston, MA, USA;4. Media Lab, Massachusetts Institute of Technology, Cambridge, MA, USA;5. Department of Nutrition, Harvard T.H. Chan School of Public Health, Boston, MA, USA
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.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号