Skip to content
Conference proceedings

Density Functions for Visual Attributes and Effective Partitioning in Graph Visualization

Herman I, Marshall M, Melançon G ...see all

IEEE Information Visualization Symposium (2000) pp. 49-56 Published by IEEE CS Press

  • 11

    Readers

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

    Citations

    Citations of this article.
  • N/A

    Views

    ScienceDirect users who have downloaded this article.
Sign in to save reference

Abstract

Two tasks in graph visualization require partitioning: the assignment of visual attributes and divisive clustering. Often, we would like to assign a color or other visual attributes to a node or edge that indicates an associated value. In an application involving divisive clustering, we would like to partition the graph into subsets of graph elements based on metric values in such a way that all subsets are evenly populated. Assuming a uniform distribution of metric values during either partitioning or coloring can have undesired effects such as empty clusters or only one level of emphasis for the entire graph. Probability density functions derived from statistics about a metric can help systems succeed at these tasks

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

Get full text

Authors

  • Ivan Herman

  • M. Scott Marshall

  • Guy Melançon

Cite this document

Choose a citation style from the tabs below