(click on the picture to view VRML file)
| node type: | paper in a Graph Drawing Symposium |
| edge type: | cites |
| number of nodes: | 304 (largest connected component, without GD contest reports) |
| number of edges: | 753 |
| source: | graphael project, http://graphael.cs.arizona.edu/graphael/ |
In the edge-repulsion LinLog drawing, the groups of nodes approximately correspond to research areas like three-dimensional graph drawing, orthogonal graph drawing, labeling, graph clustering and clustered/compound graphs, force-directed graph drawing. However, the number of citations is small for many papers, and 2 or 3 citations are not enough information to reliably assign a paper to a research area. (This is a limitation of the input data, not of the clustering method.)
|
| Edge-repulsion LinLog model (click on the picture to view VRML file) |
 |
 |
| Fruchterman-Reingold model (for comparision) | Node-repulsion LinLog model (for comparison) |
| back |