کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
430609 688061 2011 13 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Multiscale approach for the network compression-friendly ordering
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Multiscale approach for the network compression-friendly ordering
چکیده انگلیسی

We present a fast multiscale approach for the network minimum logarithmic arrangement problem. This type of arrangement plays an important role in the network compression and fast node/link access operations. The algorithm is of linear complexity and exhibits good scalability, which makes it practical and attractive for use in large-scale instances. Its effectiveness is demonstrated on a large set of real-life networks. These networks with corresponding best-known minimization results are suggested as an open benchmark for the research community to evaluate new methods for this problem.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Discrete Algorithms - Volume 9, Issue 2, June 2011, Pages 190–202
نویسندگان
, ,