Results 1 
5 of
5
Visualisation and analysis of large and complex scalefree networks
 IN: IN PROCEEDINGS EUROGRAPHICS / IEEE VGTC SYMPOSIUM ON VISUALIZATION (EUROVIS
, 2005
"... Scalefree networks appear in many application domains such as social and biological networks [BA99, BB03, BO04]. Roughly speaking, scalefree networks have powerlaw degree distribution, ultrashort average path length and high clustering coefficient [BA99, BB03, BO04]. This paper presents new meth ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
(Show Context)
Scalefree networks appear in many application domains such as social and biological networks [BA99, BB03, BO04]. Roughly speaking, scalefree networks have powerlaw degree distribution, ultrashort average path length and high clustering coefficient [BA99, BB03, BO04]. This paper presents new methods for visualising scalefree 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 forcedirected graph layout method [QE00]. Results with real world data sets such as IEEE InfoVis citation and collaboration networks and a proteinprotein interaction network show that our method can be useful for visual analysis of large and complex scalefree networks. We also discuss the issue of visualisation of evolving networks and network integration.'
Flexible representation of computational meshes
, 2005
"... A new representation of computational meshes is proposed in terms of a covering relation defined by discrete topological objects we call sieves. Fields over a mesh are handled locally by using the notion of refinement, dual to covering, and are later reassembled. In this approach fields are modeled ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
A new representation of computational meshes is proposed in terms of a covering relation defined by discrete topological objects we call sieves. Fields over a mesh are handled locally by using the notion of refinement, dual to covering, and are later reassembled. In this approach fields are modeled by sections of a fiber bundle over a sieve. This approach cleanly separates the topology of the mesh from its geometry and other valuestorage mechanisms. With these abstractions, finite element calculations are expressed using algorithms that are independent of mesh dimension, global topology, element shapes, and the finite element itself. Extensions and other applications are discussed.
zur Erlangung des Grades eines
"... Symbolic dynamics and scattering theory for localized magnetic fields ..."
and Dissertations. Paper 74.
"... Graph partitioning algorithms for minimizing internode communication on a distributed system ..."
Abstract
 Add to MetaCart
(Show Context)
Graph partitioning algorithms for minimizing internode communication on a distributed system