Multiscale approach for the network compression-friendly ordering

Authors:
Ilya Safro;Boris Temkin
Affiliations:
Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL 60439, USA;Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL 60439, USA
Venue:
Journal of Discrete Algorithms
Year:
2011

Citing 13
Cited 1

Optimal linear labelings and eigenvalues of graphs

Discrete Applied Mathematics
A survey of graph layout problems

ACM Computing Surveys (CSUR)
Towards Compressing Web Graphs

DCC '01 Proceedings of the Data Compression Conference
The webgraph framework I: compression techniques

Proceedings of the 13th international conference on World Wide Web
Graph minimum linear arrangement by multilevel weighted edge contractions

Journal of Algorithms
A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs

Journal of Graph Theory
Microscopic evolution of social networks

Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Multilevel algorithms for linear ordering problems

Journal of Experimental Algorithmics (JEA)
Permuting Web Graphs

WAW '09 Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph
On compressing social networks

Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Compression of graphical structures

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Locality and attachedness-based temporal social network growth dynamics analysis: A case study of evolving nanotechnology scientific collaboration networks

Journal of the American Society for Information Science and Technology
The university of Florida sparse matrix collection

ACM Transactions on Mathematical Software (TOMS)

Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks

Proceedings of the 20th international conference on World wide web

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.