Graph summarization with bounded error

Navlakha, S., Rastogi, R., Shrivastava, N. (June 2008) Graph summarization with bounded error. ACM, 419-431; Art no. 1376661. ISBN 07308078 (ISSN); 9781605581026 (ISBN)

DOI: 10.1145/1376616.1376661


We propose a highly compact two-part representation of a given graph G consisting of a graph summary and a set of corrections. The graph summary is an aggregate graph in which each node corresponds to a set of nodes in G, and each edge represents the edges between all pair of nodes in the two sets. On the other hand, the corrections portion specifies the list of edge-corrections that should be applied to the summary to recreate G. Our representations allow for both lossless and lossy graph compression with bounds on the introduced error. Further, in combination with the MDL principle, they yield highly intuitive coarse-level summaries of the input graph G. We develop algorithms to construct highly compressed graph representations with small sizes and guaranteed accuracy, and validate our approach through an extensive set of experiments with multiple real-life graph data sets. To the best of our knowledge, this is the first work to compute graph summaries using the MDL principle, and use the summaries (along with corrections) to compress graphs with bounded error. Copyright 2008 ACM.

Item Type: Book
Additional Information: Conference
Subjects: bioinformatics > computational biology > algorithms
CSHL Authors:
Communities: CSHL labs > Navlakha lab
Depositing User: Matthew Dunn
Date: June 2008
Date Deposited: 08 Nov 2019 20:08
Last Modified: 08 Nov 2019 20:08
Related URLs:

Actions (login required)

Administrator's edit/view item Administrator's edit/view item
CSHL HomeAbout CSHLResearchEducationNews & FeaturesCampus & Public EventsCareersGiving