loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing
Placing a Liaison between Two Members of the Same Level in an Organization Structure of a Complete Binary Tree
August 06-August 08
ISBN: 978-0-7695-3263-9
ASCII Text
x 
 
Kiyoshi Sawada, "Placing a Liaison between Two Members of the Same Level in an Organization Structure of a Complete Binary Tree," Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on, pp. 69-72, 2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2008.
 
 
BibTex
x
 
@article{ 10.1109/SNPD.2008.74,
author = {Kiyoshi Sawada},
title = {Placing a Liaison between Two Members of the Same Level in an Organization Structure of a Complete Binary Tree},
journal ={Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on},
volume = {0},
year = {2008},
isbn = {978-0-7695-3263-9},
pages = {69-72},
doi = {http://doi.ieeecomputersociety.org/10.1109/SNPD.2008.74},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on
TI - Placing a Liaison between Two Members of the Same Level in an Organization Structure of a Complete Binary Tree
SN - 978-0-7695-3263-9
SP69
EP72
A1 - Kiyoshi Sawada,
PY - 2008
KW - Organization structure
KW - Liaison
KW - Complete Binary tree
KW - Shortest path
VL - 0
JA - Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, ACIS International Conference on
ER -
 
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.
Index Terms:
Organization structure, Liaison, Complete Binary tree, Shortest path
Citation:
Kiyoshi Sawada, "Placing a Liaison between Two Members of the Same Level in an Organization Structure of a Complete Binary Tree," snpd, pp.69-72, 2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2008
Usage of this product signifies your acceptance of the Terms of Use.