TopoLayout: Multilevel graph layout by topological features

  • Archambault D
  • Munzner T
  • Auber D
  • 79

    Readers

    Mendeley users who have this article in their library.
  • 91

    Citations

    Citations of this article.

Abstract

We describe TopoLayout, a feature-based, multilevel algorithm that draws undirected graphs based on the topological features they contain. Topological features are detected recursively inside the graph, and their subgraphs are collapsed into single nodes, forming a graph hierarchy. Each feature is drawn with an algorithm tuned for its topology. As would be expected from a feature-based approach, the runtime and visual quality of TopoLayout depends on the number and types of topological features present in the graph. We show experimental results comparing speed and visual quality for TopoLayout against four other multilevel algorithms on a variety of data sets with a range of connectivities and sizes. TopoLayout frequently improves the results in terms of speed and visual quality on these data sets.

Author-supplied keywords

  • Graph visualization
  • Graphs and networks
  • Information visualization

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Daniel Archambault

  • Tamara Munzner

  • David Auber

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free