Results 1  10
of
19
Graph Visualization and Navigation in Information Visualization: a Survey
 IEEE Transactions on Visualization and Computer Graphics
, 2000
"... This is a survey on graph visualization and navigation techniques, as used in information visualization. Graphs appear in numerous applications such as web browsing, statetransition diagrams, and data structures. The ability to visualize and to navigate in these potentially large, abstract graphs ..."
Abstract

Cited by 326 (3 self)
 Add to MetaCart
This is a survey on graph visualization and navigation techniques, as used in information visualization. Graphs appear in numerous applications such as web browsing, statetransition diagrams, and data structures. The ability to visualize and to navigate in these potentially large, abstract graphs is often a crucial part of an application. Information visualization has specific requirements, which means that this survey approaches the results of traditional graph drawing from a different perspective. Index TermsInformation visualization, graph visualization, graph drawing, navigation, focus+context, fisheye, clustering. 1
Towards A Discipline Of Experimental Algorithmics
"... The last 20 years have seen enormous progress in the design of algorithms, but very little of it has been put into practice, even within academia; indeed, the gap between theory and practice has continuously widened over these years. Moreover, many of the recently developed algorithms are very hard ..."
Abstract

Cited by 36 (8 self)
 Add to MetaCart
The last 20 years have seen enormous progress in the design of algorithms, but very little of it has been put into practice, even within academia; indeed, the gap between theory and practice has continuously widened over these years. Moreover, many of the recently developed algorithms are very hard to characterize theoretically and, as initially described, suffer from large runningtime coefficients. Thus the algorithms and data structures community needs to return to implementation as the standard of value; we call such an approach Experimental Algorithmics. Experimental Algorithmics studies algorithms and data structures by joining experimental studies with the more traditional theoretical analyses. Experimentation with algorithms and data structures is proving indispensable in the assessment of heuristics for hard problems, in the design of test cases, in the characterization of asymptotic behavior of complex algorithms, in the comparison of competing designs for tractabl...
Aesthetics of Class Diagrams
 In Proceedings of the First IEEE International Workshop on Visualizing Software for Understanding and Analysis
, 2002
"... Visualization of objectoriented programs by class diagrams is a widely used technique. So far no commonly agreed aesthetic criteria have been recorded in order to standardize and measure the quality of class diagrams. In this paper we focus on UML class diagrams, the standard notation for class dia ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
Visualization of objectoriented programs by class diagrams is a widely used technique. So far no commonly agreed aesthetic criteria have been recorded in order to standardize and measure the quality of class diagrams. In this paper we focus on UML class diagrams, the standard notation for class diagrams in software engineering. We propose some aesthetic criteria which reflect the highly sophisticated features of UML class diagrams, a layout algorithm which respects all these features and an implementation of a graph drawing framework which is able to produce drawings according to these criteria.
A TopologyShapeMetrics Approach for the Automatic Layout of UML Class Diagrams
"... Class diagrams are among the most popular visualizations for object oriented software systems and have a broad range of applications. In many settings it is desirable that the placement of the diagram elements is determined automatically, especially when the diagrams are generated automatically whic ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
Class diagrams are among the most popular visualizations for object oriented software systems and have a broad range of applications. In many settings it is desirable that the placement of the diagram elements is determined automatically, especially when the diagrams are generated automatically which is usually the case in reverse engineering. For this reason the automatic layout of class diagram gained importance in the last years. Current approaches for the automatic layout of class diagrams are based on the hierarchic graph drawing paradigm. These algorithms produce good results for class diagrams with large and deep structural information, i.e., diagrams with a large and deep inheritance hierarchy. However, they do not perform satisfactorily in absence of this information. We propose in this work a new algorithm for automatic layout of class diagram which is based on the topologyshapemetrics approach. The algorithm is an adaption of sophisticated graph drawing algorithms which have proven their effectiveness in many applications. The algorithm works as well for class diagrams with rich structural information as for class diagrams with few or no structural information. It improves therefore the existing algorithms significantly. An implementation of the algorithm is used in the reverse engineering tool JarInspector.
Planar decompositions and the crossing number of graphs with an excluded minor
 IN GRAPH DRAWING 2006; LECTURE NOTES IN COMPUTER SCIENCE 4372
, 2007
"... Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrary planar graph to index the decomposition. We prove that every graph that excludes a fixed graph as a minor has a planar ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrary planar graph to index the decomposition. We prove that every graph that excludes a fixed graph as a minor has a planar decomposition with bounded width and a linear number of bags. The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the plane. We prove that planar decompositions are intimately related to the crossing number. In particular, a graph with bounded degree has linear crossing number if and only if it has a planar decomposition with bounded width and linear order. It follows from the above result about planar decompositions that every graph with bounded degree and an excluded minor has linear crossing number. Analogous results are proved for the convex and rectilinear crossing numbers. In particular, every graph with bounded degree and bounded treewidth has linear convex crossing number, and every K3,3minorfree graph with bounded degree has linear rectilinear crossing number.
Visualizing gene interaction graphs with local multidimensional scaling
 In this volume
, 2006
"... Reprinted with permission. ..."
Effects of Sociogram Drawing Conventions and Edge Crossings in Social Network Visualization
 Journal of Graph Algorithms and Applications
, 2007
"... This paper describes a withinsubjects experiment. In this experiment, the effects of different spatial layouts on human sociogram perception are examined. We compare the relative effectiveness of five sociogram drawing conventions in communicating underlying network substance, based on user task pe ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
This paper describes a withinsubjects experiment. In this experiment, the effects of different spatial layouts on human sociogram perception are examined. We compare the relative effectiveness of five sociogram drawing conventions in communicating underlying network substance, based on user task performance and personal preference. We also explore the impact of edge crossings, a widely accepted readability aesthetic. Both objective performance and subjective questionnaire measures are employed in the study. Subjective data are gathered based on the methodology of Purchase et al. [70], while objective data are collected through an online system. We found that 1) both edge crossings and drawing conventions pose significant effects on user preference and task performance of finding groups, but neither has much impact on the perception of actor status. On the other hand, node positioning and angular resolution may be more important in perceiving actor status. In visualizing social networks, it is important to note that the techniques that are highly preferred by users do not necessarily lead to best task performance. 2) subjects have a strong preference of placing nodes on the top or in the center to highlight importance, and clustering nodes in the same group and separating clusters to highlight groups. They have tendency to believe that nodes on the top or in the center are more important, and nodes in close proximity belong to the same group. Some preliminary recommendations for sociogram design and hypotheses about human reading behavior are proposed.
Contextual Visualization of Actor Status in Social Networks
 In Data Visualization 2000. Proc. 2nd Joint Eurographics/IEEE TCVG Symp. Visualization (VisSym ’00
"... We propose a novel information visualization approach for an analytical method applied in the social sciences. In social network analysis, social structures are formally represented as graphs, and structural properties of these graphs are assumed to be useful in the explanation of social phenomena. ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
We propose a novel information visualization approach for an analytical method applied in the social sciences. In social network analysis, social structures are formally represented as graphs, and structural properties of these graphs are assumed to be useful in the explanation of social phenomena. A particularly important such property is the relative status of actors in a given network. Since operationalists...
Skeletal Animation for the Exploration of Graphs
, 2002
"... The topic of skeletal animation and its associated techniques have previously been applied in the area of animating computergenerated characters for motion pictures and computer games. This thesis investigates the use of similar techniques in the scope of exploring threedimensional visualisations ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The topic of skeletal animation and its associated techniques have previously been applied in the area of animating computergenerated characters for motion pictures and computer games. This thesis investigates the use of similar techniques in the scope of exploring threedimensional visualisations of relational networks (graphs). A system
Visualization Methods for Longitudinal Social Networks and Actorbased Modeling
, 2011
"... As a consequence of the rising interest in longitudinal social networks and their analysis, there is also an increasing demand for tools to visualize them. We argue that similar adaptations of stateoftheart graphdrawing methods can be used to visualize longitudinal networks and the fit of actor ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
As a consequence of the rising interest in longitudinal social networks and their analysis, there is also an increasing demand for tools to visualize them. We argue that similar adaptations of stateoftheart graphdrawing methods can be used to visualize longitudinal networks and the fit of actorbased models, the most prominent approach for analyzing such networks. The proposed methods are illustrated on a longitudinal network of acquaintanceship among university freshmen.