Skip to content

Density Functions for Visual Attributes and Effective Partitioning in Graph Visualization

by Ivan Herman, M. Scott Marshall, Guy Melançon
IEEE Information Visualization Symposium ()
Get full text at journal


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

Cite this document (BETA)

Readership Statistics

10 Readers on Mendeley
by Discipline
80% Computer Science
10% Agricultural and Biological Sciences
10% Physics and Astronomy
by Academic Status
40% Researcher
20% Student > Ph. D. Student
20% Student > Master
by Country
20% United Kingdom
10% Germany
10% Australia

Sign up today - FREE

Mendeley saves you time finding and organizing research. Learn more

  • All your research in one place
  • Add and import papers easily
  • Access it anywhere, anytime

Start using Mendeley in seconds!

Sign up & Download

Already have an account? Sign in