کد مقاله کد نشریه سال انتشار مقاله انگلیسی ترجمه فارسی نسخه تمام متن
4944123 1363983 2018 8 صفحه PDF ندارد دانلود رایگان
عنوان انگلیسی مقاله
Converting a network into a small-world network: Fast algorithms for minimizing average path length through link addition
ترجمه فارسی عنوان
تبدیل یک شبکه به یک شبکه جهان کوچک: الگوریتم های سریع برای به حداقل رساندن طول میانگین مسیر از طریق افزودن لینک
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
چکیده انگلیسی

The average path length in a network is an important parameter for measuring the end-to-end delay for message delivery. The delay between an arbitrary pair of nodes is smaller if the average path length is low. It is possible to reduce the average path length of a network by adding one or more additional links between pairs of nodes. However, a naïve algorithm is often very expensive for determining which additional link can reduce the average path length in a network the most. In this paper, we present two efficient algorithms to minimize the average network path length by link addition. Our algorithms can process significantly larger networks compared to the naïve algorithm. We present simple implementations of our algorithms, as well as performance studies.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Sciences - Volume 422, January 2018, Pages 282-289
نویسندگان
, , ,