Visual summaries for graph collections

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Graphs can be used to represent a variety of information, from molecular structures to biological pathways to computational workflows. With a growing volume of data represented as graphs, the problem of understanding and analyzing the variations in a collection of graphs is of increasing importance. We present an algorithm to compute a single summary graph that efficiently encodes an entire collection of graphs by finding and merging similar nodes and edges. Instead of only merging nodes and edges that are exactly the same, we use domain-specific comparison functions to collapse similar nodes and edges which allows us to generate more compact representations of the collection. In addition, we have developed methods that allow users to interactively control the display of these summary graphs. These interactions include the ability to highlight individual graphs in the summary, control the succinctness of the summary, and explicitly define when specific nodes should or should not be merged. We show that our approach to generating and interacting with graph summaries leads to a better understanding of a graph collection by allowing users to more easily identify common substructures and key differences between graphs.

Original languageEnglish (US)
Title of host publicationIEEE Symposium on Pacific Visualization 2013, PacificVis 2013 - Proceedings
Number of pages8
StatePublished - 2013
Event6th IEEE Symposium on Pacific Visualization, PacificVis 2013 - Sydney, NSW, Australia
Duration: Feb 26 2013Mar 1 2013

Publication series

NameIEEE Pacific Visualization Symposium
ISSN (Print)2165-8765
ISSN (Electronic)2165-8773


Other6th IEEE Symposium on Pacific Visualization, PacificVis 2013
CitySydney, NSW

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Computer Vision and Pattern Recognition
  • Hardware and Architecture
  • Software


Dive into the research topics of 'Visual summaries for graph collections'. Together they form a unique fingerprint.

Cite this