A Model of Adding Relations in Multi-levels to a Formal Organization Structure with Two Subordinates
Kiyoshi Sawada, Kazuyuki Amano, Sio-Iong Ao, Alan H. S. Chan, Hideki Katagiri, Xu Li · AIP conference proceedings · 2009
This paper proposes a model of adding relations in multi‐levels to a formal organization structure with two subordinates such that the communication of information between every member in the organization becomes the most efficient. When edges between every pair of nodes with the same depth in L (L = 1, 2, …, H) levels are added to a complete binary tree of height H, an optimal set of depths {N1, N2, …, NL} (H⩾N1>N2> …>NL⩾1) is obtained by maximizing the total shortening path length which is the sum of shortening lengths of shortest paths between every pair of all nodes in the complete binary tree. It is shown that {N1, N2, …, NL}* = {H, H−1, …, H−L+1}.