Description

When looking at drawings of graphs, questions about graph density, community structures, local clustering and other graph properties may be of critical importance for analysis. While graph layout algorithms have

When looking at drawings of graphs, questions about graph density, community structures, local clustering and other graph properties may be of critical importance for analysis. While graph layout algorithms have focused on minimizing edge crossing, symmetry, and other such layout properties, there is not much known about how these algorithms relate to a user’s ability to perceive graph properties for a given graph layout.

25.32 MB application/pdf

Download count: 0

Details

Contributors
Date Created
  • 2018
Resource Type
  • Text
  • Collections this item is in
    Note
    • Masters Thesis Computer Science 2018

    Machine-readable links