Title :
Placing a Liaison between Two Members of the Same Level in an Organization Structure of a Complete Binary Tree
Author_Institution :
Dept. of Inf. & Manage. Sci., Univ. of Marketing & Distrib. Sci., Kobe
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.
Keywords :
organisational aspects; trees (mathematics); complete binary tree; pyramid organization structure; shortest paths; Artificial intelligence; Binary trees; Computer network management; Conference management; Distributed computing; Electronic mail; Engineering management; Information management; Marketing management; Software engineering; Complete Binary tree; Liaison; Organization structure; Shortest path;
Conference_Titel :
Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2008. SNPD '08. Ninth ACIS International Conference on
Conference_Location :
Phuket
Print_ISBN :
978-0-7695-3263-9
DOI :
10.1109/SNPD.2008.74