A model of adding two edges in levels of a complete binary tree
Department of Economic Information, University of Marketing and Distribution Sciences, Kobe, Japan
* Corresponding author: Kiyoshi_Sawada@red.umds.ac.jp
This study proposes a model of adding two edges between nodes of the same level of a complete binary tree. Firstly we add one edge between the optimal two nodes with the optimal depth N* maximizing a total shortening distance. Secondly we add another edge between nodes with the same depth M (M = 1, 2, …, H). The total shortening distance to obtain the optimal two nodes with the optimal depth M* maximizing a total shortening distance is formulated.
© The Authors, published by EDP Sciences, 2017
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.