Paper Info
Title
Placing a Liaison between Two Members of the Same Level in an Organization Structure of a Complete Binary Tree
Abstract
This paper proposes a model of placing a liaison which forms relations to two members of the same level in a pyramid organization structure such that the communication of information between every member in the organization becomes the most efficient. For the model of adding a node of liaison which gets adjacent to two nodes with the same depth N in a complete binary tree of height H which can describe the basic type of a pyramid organization, we obtained an optimal depth N* which maximizes the sum of shortening lengths of shortest paths between every pair of all nodes.
Year
DOI
Venue
2008
10.1109/SNPD.2008.74
SNPD
Keywords
Field
DocType
basic type,height h,complete binary tree,depth n,shortest path,organization structure,pyramid organization,pyramid organization structure,optimal depth,mathematical model,binary trees,pediatrics,organizations,cybernetics,binary tree
Shortest path problem,Organizational structure,Computer science,Binary tree,Algorithm,Theoretical computer science,Pyramid,Cybernetics,Distributed computing
Conference
Citations 
PageRank 
References 
3
1.17
0
Authors
1
Name
Order
Citations
PageRank
Kiyoshi Sawada143.97