Multiscale approach for the network compression-friendly ordering

DOI10.1016/j.jda.2010.09.007zbMath1217.90045OpenAlexW2020378392WikidataQ111521727 ScholiaQ111521727MaRDI QIDQ553960

Boris Temkin, Ilya Safro

Publication date: 29 July 2011

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2010.09.007

zbMATH Keywords

multiscale algorithmsminimum logarithmic arrangementnetwork compression

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (2)

Relaxation-Based Coarsening for Multilevel Hypergraph Partitioning ⋮ Unnamed Item

Uses Software

• SNAP
• SparseMatrix
• WebGraph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hybrid metaheuristics. An emerging approach to optimization.
• Optimal linear labelings and eigenvalues of graphs
• Graph compression by BFS
• Relaxation-Based Coarsening and Multiscale Graph Organization
• Algebraic Distance on Graphs
• Permuting Web Graphs
• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• A spectral algorithm for envelope reduction of sparse matrices
• Multilevel algorithms for linear ordering problems
• Graph minimum linear arrangement by multilevel weighted edge contractions

This page was built for publication: Multiscale approach for the network compression-friendly ordering