Show simple item record

dc.contributor.authorAhmed, Adelen_US
dc.contributor.authorDywer, Timen_US
dc.contributor.authorHong, Seok-Heeen_US
dc.contributor.authorMurray, Colinen_US
dc.contributor.authorSong, Leen_US
dc.contributor.authorWu, Ying Xinen_US
dc.contributor.editorKen Brodlie and David Duke and Ken Joyen_US
dc.date.accessioned2014-01-31T06:52:09Z
dc.date.available2014-01-31T06:52:09Z
dc.date.issued2005en_US
dc.identifier.isbn3-905673-19-3en_US
dc.identifier.issn1727-5296en_US
dc.identifier.urihttp://dx.doi.org/10.2312/VisSym/EuroVis05/239-246en_US
dc.description.abstractScale-free networks appear in many application domains such as social and biological networks [BA99, BB03, BO04]. Roughly speaking, scale-free networks have power-law degree distribution, ultra-short average path length and high clustering coefficient [BA99, BB03, BO04]. This paper presents new methods for visualising scale-free networks in three dimensions. To make effective use of the third dimension and minimise occlusion, we produce graph visulaisations with nodes constrained to lie on parallel planes or on the surface of spheres. We implement the algorithms using a variation of a fast force-directed graph layout method [QE00]. Results with real world data sets such as IEEE InfoVis citation and collaboration networks and a protein-protein interaction network show that our method can be useful for visual analysis of large and complex scale-free networks. We also discuss the issue of visualisation of evolving networks and network integration.en_US
dc.publisherThe Eurographics Associationen_US
dc.titleVisualisation and Analysis of Large and Complex Scale-free Networksen_US
dc.description.seriesinformationEUROVIS 2005: Eurographics / IEEE VGTC Symposium on Visualizationen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record