Name
Abstract | ||
|---|---|---|
This paper proposes three models of adding relations to an organization structure which is a complete K-ary tree of height H: (i) a model of adding an edge between two nodes with the same depth N, (ii) a model of adding edges between every pair of nodes with the same depth N and (iii) a model of adding edges between every pair of siblings with the same depth N. For each of the three 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 | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.ejor.2005.01.067 | European Journal of Operational Research |
Keywords | DocType | Volume |
Graph theory,Organization structure,Complete K-ary tree,Shortest path length | Journal | 174 |
Issue | ISSN | Citations |
3 | 0377-2217 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kiyoshi Sawada | 1 | 4 | 3.97 |
| Richard Wilson | 2 | 0 | 0.34 |