A MODEL OF FORMING RELATIONS BETWEEN EVERY PAIR OF K OR LESS MEMBERS IN THE SAME LEVEL OF A LINKING PIN ORGANIZATION STRUCTURE WITH K SUBORDINATES
Our study considers the addition of relation to an organization structure such that the communication of information between every member in the organization becomes the most efficient. This study proposes a model of adding relations to a linking pin type organization structure where every pair of siblings in a complete K-ary tree of height H is adjacent. When edges between every pair of P(P=2; 3;:::;K) nodes with the same depth N are added, an optimal set of P nodes with an optimal depth N 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.
Organization structure Linking pin Complete K-ary tree Shortest path length
Kiyoshi Sawada
Department of Information and Management Science, University of Marketing and Distribution Sciences, 3-1 Gakuen-nishi-machi, Nishi-ku, Kobe 651-2188, Japan
国际会议
上海
英文
1-4
2009-08-02（万方平台首次上网日期，不代表论文的发表时间）