Results 1  10
of
13
A Multidimensional Approach to ForceDirected Layouts of Large Graphs
, 2000
"... Abstract. We present a novel hierarchical forcedirected method for drawing large graphs. The algorithm produces a graph embedding in an Euclidean space E of any dimension. A two or three dimensional drawing of the graph is then obtained by projecting a higherdimensional embedding into a two or thr ..."
Abstract

Cited by 38 (5 self)
 Add to MetaCart
Abstract. We present a novel hierarchical forcedirected method for drawing large graphs. The algorithm produces a graph embedding in an Euclidean space E of any dimension. A two or three dimensional drawing of the graph is then obtained by projecting a higherdimensional embedding into a two or three dimensional subspace of E. Projecting highdimensional drawings onto two or three dimensions often results in drawings that are “smoother ” and more symmetric. Among the other notable features of our approach are the utilization of a maximal independent set filtration of the set of vertices of a graph, a fast energy function minimization strategy, efficient memory management, and an intelligent initial placement of vertices. Our implementation of the algorithm can draw graphs with tens of thousands of vertices using a negligible amount of memory in less than one minute on a midrange PC. 1
A Fast MultiDimensional Algorithm for Drawing Large Graphs
 In Graph Drawing’00 Conference Proceedings
, 2000
"... We present a novel hierarchical forcedirected method for drawing large graphs. The algorithm produces a graph embedding in an Euclidean space E of any dimension. A two or three dimensional drawing of the graph is then obtained by projecting a higherdimensional embedding into a two or three dimensi ..."
Abstract

Cited by 28 (4 self)
 Add to MetaCart
We present a novel hierarchical forcedirected method for drawing large graphs. The algorithm produces a graph embedding in an Euclidean space E of any dimension. A two or three dimensional drawing of the graph is then obtained by projecting a higherdimensional embedding into a two or three dimensional subspace of E. Projecting highdimensional drawings onto two or three dimensions often results in drawings that are "smoother" and more symmetric. Among the other notable features of our approach are the utilization of a maximal independent set filtration of the set of vertices of a graph, a fast energy function minimization strategy, e#cient memory management, and an intelligent initial placement of vertices. Our implementation of the algorithm can draw graphs with tens of thousands of vertices using a negligible amount of memory in less than one minute on a midrange PC. 1 Introduction Graphs are common in many applications, from data structures to networks, from software engineering...
A Multilevel Approach to the Travelling Salesman Problem
 Operations Research
, 2000
"... We motivate, derive and implement a multilevel approach to the travelling salesman problem. The resulting algorithm progressively coarsens the problem, initialises a tour and then employs either the LinKernighan (LK) or the Chained LinKernighan (CLK) algorithm to refine the solution on each of th ..."
Abstract

Cited by 22 (5 self)
 Add to MetaCart
We motivate, derive and implement a multilevel approach to the travelling salesman problem. The resulting algorithm progressively coarsens the problem, initialises a tour and then employs either the LinKernighan (LK) or the Chained LinKernighan (CLK) algorithm to refine the solution on each of the coarsened problems in reverse order. In experiments on a well established test suite of 79 problem instances we found multilevel configurations that either improved the tour quality by over 25% as compared to the standard CLK algorithm using the same amount of execution time, or that achieved approximately the same tour quality over 7 times more rapidly. Moreover the multilevel variants seem to optimise far better the more clustered instances with which the LK & CLK algorithms have the most difficulties.
Visualizing large graphs with compoundfisheye views and treemaps
 In 12th Symposium on Graph Drawing (GD
, 2004
"... Abstract. Compoundfisheye views are introduced as a method for the display and interaction with large graphs. The method relies on a hierarchical clustering of the graph, and a generalization of the traditional fisheye view, together with a treemap representation of the cluster tree. 1 ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
Abstract. Compoundfisheye views are introduced as a method for the display and interaction with large graphs. The method relies on a hierarchical clustering of the graph, and a generalization of the traditional fisheye view, together with a treemap representation of the cluster tree. 1
A study of Evolutionary Graph Drawing
"... Graph Drawing addresses the problem of finding a layout of a graph that satisfies a given aesthetic objective. This problem is very important for programs that visualize diagrams such as those used in Software Engineering methodologies, Data Mining functional dependencies, Semantic and Bayesian Netw ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Graph Drawing addresses the problem of finding a layout of a graph that satisfies a given aesthetic objective. This problem is very important for programs that visualize diagrams such as those used in Software Engineering methodologies, Data Mining functional dependencies, Semantic and Bayesian Networks, etc. This paper is concerned with developing a general approach for Graph Drawing based on Evolutionary Algorithms. We use (1+1)Evolution Strategies which is justified by previous work. Experimental results on 146 graphs demonstrate the algorithms capacity for solving the most important problem in the graph drawing field: edgecrossings minimization. In addition, a preliminary study has shown how to acquire and satisfy subjective user criteria. The algorithm has shown to be fast enough what allows its use in realworld programs that visualize diagrams.
Integrated Visualization for Semantic Web
"... In this paper, we present an integrated Semantic Web interactive visualization environment (ISWIVE) to visualize the information of Topic Maps and RDF. In ISWIVE, both the detailed resource descriptions and the overall topic relationship can be clearly displayed. Besides, the interactive local viewe ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper, we present an integrated Semantic Web interactive visualization environment (ISWIVE) to visualize the information of Topic Maps and RDF. In ISWIVE, both the detailed resource descriptions and the overall topic relationship can be clearly displayed. Besides, the interactive local viewer and visual query interface facilitate browsing and searching over the Semantic Web resources. 1
Drawing
"... We propose a graph drawing algorithm that is both efficient and high quality. This algorithm combines a multilevel approach, which effectively overcomes local minimums, with the Barnes and Hut [1] octree technique, which approximates short and longrange force efficiently. Our numerical results sho ..."
Abstract
 Add to MetaCart
We propose a graph drawing algorithm that is both efficient and high quality. This algorithm combines a multilevel approach, which effectively overcomes local minimums, with the Barnes and Hut [1] octree technique, which approximates short and longrange force efficiently. Our numerical results show that the algorithm is comparable in speed to Walshaw’s [2] highly efficient multilevel graph drawing algorithm, yet gives better results on some of the difficult problems. In addition, an adaptive cooling scheme for the forcedirected algorithms and a general repulsive force model are proposed. The proposed graph drawing algorithm and others are included with Mathematica 5.1 and later versions in the package DiscreteMath‘GraphÑ Plot.
Algorithms for Visualizing Large Networks
, 2010
"... Graphs are often used to encapsulate relationship between objects. Graph drawing enables visualization of such relationships. The usefulness of this visual representation is dependent on whether the drawing is aesthetic. While there are no strict criteria for aesthetics of a drawing, it is generally ..."
Abstract
 Add to MetaCart
Graphs are often used to encapsulate relationship between objects. Graph drawing enables visualization of such relationships. The usefulness of this visual representation is dependent on whether the drawing is aesthetic. While there are no strict criteria for aesthetics of a drawing, it is generally agreed, for example,