A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Small-world networks are a very commonly occurring type of graph in the real-world, which exhibit a clustered structure that is not well represented by current graph layout algorithms. In many cases we also have information about the nodes in such graphs, which are typically depicted on the graph as node colour, shape or size. Here we demonstrate that these attributes can instead be used to layout the graph in highdimensional data space. Then using a dimension reduction technique, targeteddoi:10.1109/iv.2011.64 dblp:conf/iv/GibsonF11 fatcat:fl3fcoc4c5bovl5tgdh3tasjmu