Paper Info
Title
Models of Adding Relations to a Linking Pin Type Organization Structure
Abstract
This paper proposes two models 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: (i) a model of adding an edge between two nodes with the same depth N and (ii) a model of adding edges between every pair of nodes with the same depth N. For each of the two models, 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.
Year
Venue
Keywords
2007
Lecture Notes in Engineering and Computer Science
organization structure,linking pin,adding relation,complete K-ary tree,shortest path length
Field
DocType
Citations 
Discrete mathematics,Combinatorics,Organizational structure,Path length,Ordinate,Mathematics
Conference
0
PageRank 
References 
Authors
0.34
1
1
Name
Order
Citations
PageRank
Kiyoshi Sawada143.97