An additional adjacency between two levels in a complete binary tree minimizing total path length

An additional adjacency between two levels in a complete binary tree minimizing total path length

0.00 Avg rating0 Votes
Article ID: iaor20052756
Country: Japan
Volume: 13
Issue: 3
Start Page Number: 353
End Page Number: 360
Publication Date: Sep 2003
Journal: Transactions of the Japan Society for Industrial and Applied Mathematics
Authors:
Keywords: organization
Abstract:

This paper proposes a problem of adding relation to an organization structure which is a complete binary tree of height H. When one edge between a node with a depth M and its descendant with a depth N is added, an optimal pair of depth (M,N)* = (0,2) for H = 2,3,4,5 and (M,N)* = (0,4) for H = 6,7, ··· are shown. (M,N)* is obtained by maxmizing the total shortening path length which is the sum of shortening lengths of shortest paths between every pair of all nodes.

Reviews

Required fields are marked *. Your email address will not be published.