Multiscale approach for the network compression-friendly ordering

TL;DR

This paper introduces a fast, scalable multiscale algorithm for the network minimum logarithmic arrangement problem, which is crucial for network compression and efficient access, validated on real-world networks.

Contribution

A linear-complexity multiscale algorithm for network arrangement problems, providing a practical solution for large-scale networks and establishing a benchmark dataset.

Findings

Algorithm exhibits linear complexity and scalability.

Effective on large real-world networks.

Proposes a new benchmark for future research.

Abstract

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.