By Topic

Placing a Liaison between Two Members of the Same Level in an Organization Structure of a Complete Binary Tree

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Kiyoshi Sawada ; Dept. of Inf. & Manage. Sci., Univ. of Marketing & Distrib. Sci., Kobe

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.

Published in:

Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2008. SNPD '08. Ninth ACIS International Conference on

Date of Conference:

6-8 Aug. 2008