Centrality Based Visualization of Small World Graphs
| dc.contributor.author | Ham, Frank van | en_US |
| dc.contributor.author | Wattenberg, Martin | en_US |
| dc.contributor.editor | A. Vilanova, A. Telea, G. Scheuermann, and T. Moeller | en_US |
| dc.date.accessioned | 2014-02-21T18:45:14Z | |
| dc.date.available | 2014-02-21T18:45:14Z | |
| dc.date.issued | 2008 | en_US |
| dc.description.abstract | Current graph drawing algorithms enable the creation of two dimensional node-link diagrams of huge graphs. However, for graphs with low diameter (of which "small world" graphs are a subset) these techniques begin to break down visually even when the graph has only a few hundred nodes. Typical algorithms produce images where nodes clump together in the center of the screen, making it hard to discern structure and follow paths. This paper describes a solution to this problem, which uses a global edge metric to determine a subset of edges that capture the graph's intrinsic clustering structure. This structure is then used to create an embedding of the graph, after which the remaining edges are added back in. We demonstrate applications of this technique to a number of real world examples. | en_US |
| dc.description.number | 3 | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 27 | en_US |
| dc.identifier.doi | 10.1111/j.1467-8659.2008.01232.x | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/j.1467-8659.2008.01232.x | en_US |
| dc.publisher | The Eurographics Association and Blackwell Publishing Ltd. | en_US |
| dc.title | Centrality Based Visualization of Small World Graphs | en_US |