Reading 18: Graphs, Networks, Trees

by Mike Gleicher on April 11, 2012

(this reading was supposed to be due on Monday, April 16th, but since it was announced late, we’ll consider things posted before Wednesday, April 18th as on time)

To be clear here, we mean graph in the Computer Science sense (e.g. networks or relations between nodes) rather than the basic math (e.g. bar graph)

This is a whole big topic on its own. The reading range from basic overviews of the different ways to present information, to geeky details of how to implement various methods, to specific designs for different problems.

Here is a rather intimidating survey. Read it to get a sense of what the basic methods are – don’t try to get at all the details and subproblems and … Everyone should read this one (or at least skim through it).

  • von Landesberger, T., Kuijper, A., Schreck, T., Kohlhammer, J., van Wijk, J. J., Fekete, J.-D., & Fellner, D. W. (2011). Visual Analysis of Large Graphs: State-of-the-Art and Future Research Challenges. Computer Graphics Forum, 30(6), no-no. doi:10.1111/j.1467-8659.2011.01898.x (official version) (authors’s copy)

This survey is over a decade old, but gets some of the key ideas across better than the newer ones:

  • Herman, I., Melancon, G., & Marshall, M. S. (2000). Graph visualization and navigation in information visualization: A survey. IEEE Transactions on Visualization and Computer Graphics, 6(1), 24-43. doi:10.1109/2945.841119 (official IEE Version) (author’s version)

To get a sense of the ways people have thought about showing trees, check out:

This one is specific to Trees. With a focus on how to compare them. However, it’s really nice for getting a sense of the variety of ways to present this kind of information:

  • Graham, M., & Kennedy, J. (2009). A survey of multiple tree visualisation. Information Visualization, 9(4), 235-252. doi:10.1057/ivs.2009.29 (as IVS sample paper) (official page)

Here’s a video of a Tamara Munzner Talk that I like since it shows the diversity of options. I don’t necessarily like sitting through the whole hour.

  • 15 Views of a Node-Link Graph: An InfoVis Portfolio google06:Google TechTalks, Mountain View CA, 6/06 Talk video (Google video format) (slides)

Here are some specific papers that discuss things of specific interest:

  • “Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data” (download PDF)
    Danny Holten, IEEE Transactions on Visualization and Computer Graphics (TVCG; Proceedings of Vis/InfoVis 2006), Vol. 12, No. 5, Pages 741 – 748, 2006.
    (many people commented about this feature in MizBee)
  • Scalable, Versatile and Simple Constrained Graph Layout. Tim Dwyer. EuroVis 2009. (pdf)
    (this is required for Jeff Heer’s course, it’s a modern take on graph layout. the method gives a sense of the evolution and all the methods that came before it)

For Monday, April 16th, you need to have skimmed through #1 (von Landesberger) and at least looked at some of the pictures in #2 (Herman). You need to either read (skimming to get the main ideas) of #3 (Graham) or watched Munzner #4. If you’re an 838 student, you must read 5 or 6 (Holten or Dwyer). You are welcome to read more.

You also need to look at TreeVis.net. Mainly to get a sense of the diversity.

You should comment on Piazza. People generally think of good things to say, but you might want to comment on the diversity of ways to show network information. Be sure to list the things that you’ve read.

Previous post:

Next post: