Multiscale approach for the network compression-friendly ordering

Details Multiscale approach for the network compression-friendly ordering Multiscale approach for the network compression-friendly ordering

2010-04-29

arxiv.org/abs/1004.5186v1

Computer Science

Data Structures and Algorithms

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Multiscale approach for the network compression-friendly ordering does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Multiscale approach for the network compression-friendly ordering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiscale approach for the network compression-friendly ordering will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-284480