Compression of weighted graphs

Abstract

We propose to compress weighted graphs (networks), motivated by the observation that large networks of social, biological, or other relations can be complex to handle and visualize. In the process also known as graph simplification, nodes and (unweighted) edges are grouped to supernodes and superedges, respectively, to obtain a smaller graph. We propose… (More)
DOI: 10.1145/2020408.2020566

Topics

5 Figures and Tables

Statistics

010202012201320142015201620172018
Citations per Year

83 Citations

Semantic Scholar estimates that this publication has 83 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics