کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
483297 1446213 2006 10 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Models of adding relations to an organization structure of a complete K-ary tree
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
Models of adding relations to an organization structure of a complete K-ary tree
چکیده انگلیسی

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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 174, Issue 3, 1 November 2006, Pages 1491–1500
نویسندگان
, ,