Multiscale approach for the network compression-friendly ordering - Computer Science > Data Structures and AlgorithmsReport as inadecuate




Multiscale approach for the network compression-friendly ordering - Computer Science > Data Structures and Algorithms - Download this document for free, or read online. Document in PDF available to download.

Abstract: We present a fast multiscale approach for the network minimum logarithmicarrangement problem. This type of arrangement plays an important role in anetwork compression and fast node-link access operations. The algorithm is oflinear complexity and exhibits good scalability which makes it practical andattractive for using on large-scale instances. Its effectiveness isdemonstrated on a large set of real-life networks. These networks withcorresponding best-known minimization results are suggested as an openbenchmark for a research community to evaluate new methods for this problem.



Author: Ilya Safro, Boris Temkin

Source: https://arxiv.org/



DOWNLOAD PDF




Related documents