网络压缩友好排序的多尺度方法
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 a 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 using on 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 a research community to evaluate new methods for this problem.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
