Cluster relations in a graph highlighted using gvmap
This is a co-authorship graph. Each node is an author and an edge exists between two authors if their names appear on a paper from one of the International Symposia on Graph Drawing bewteeen 1994-2007. The top 8 connected components are taken, and the graph is laid out using sfdp. A map showing the clustering relationship is generated using gvmap.
Click on the picture to view the .gv file
Copyright © 2011 AT&T. All rights reserved.