Results 1  10
of
82
GraphAEL: Graph Animations with Evolving Layouts
 In 11th Symposium on Graph Drawing
, 2003
"... Abstract. GraphAEL extracts three types of evolving graphs from the Graph Drawing literature and creates 2D and 3D animations of the evolutions. We study citation graphs, topic graphs, and collaboration graphs. We also create difference graphs which capture the nature of change between two given tim ..."
Abstract

Cited by 58 (12 self)
 Add to MetaCart
(Show Context)
Abstract. GraphAEL extracts three types of evolving graphs from the Graph Drawing literature and creates 2D and 3D animations of the evolutions. We study citation graphs, topic graphs, and collaboration graphs. We also create difference graphs which capture the nature of change between two given time periods. GraphAEL can be accessed online at
Simultaneous embedding of planar graphs with few bends
 In 12th Symposium on Graph Drawing (GD
, 2004
"... We consider several variations of the simultaneous embedding problem for planar graphs. We begin with a simple proof that not all pairs of planar graphs have simultaneous geometric embedding. However, using bends, pairs of planar graphs can be simultaneously embedded on the O(n 2) × O(n 2) grid, wit ..."
Abstract

Cited by 37 (7 self)
 Add to MetaCart
(Show Context)
We consider several variations of the simultaneous embedding problem for planar graphs. We begin with a simple proof that not all pairs of planar graphs have simultaneous geometric embedding. However, using bends, pairs of planar graphs can be simultaneously embedded on the O(n 2) × O(n 2) grid, with at most three bends per edge, where n is the number of vertices. The O(n) time algorithm guarantees that two corresponding vertices in the graphs are mapped to the same location in the final drawing and that both the drawings are crossingfree. The special case when both input graphs are trees has several applications, such as contour tree simplification and evolutionary biology. We show that if both the input graphs are are trees, only one bend per edge is required. The O(n) time algorithm guarantees that both drawings are crossingsfree, corresponding tree vertices are mapped to the same locations, and all vertices (and bends) are on the O(n 2) × O(n 2) grid (O(n 3) × O(n 3) grid). For the special case when one of the graphs is a tree and the other is a path we can find simultaneous embedding with fixededges. That is, we can guarantee that corresponding vertices are mapped to the same locations and that corresponding edges are drawn the same way. We describe an O(n) time algorithm for simultaneous embedding with fixededges for treepath pairs with at most one bend per treeedge and no bends along path edges, such that all vertices (and bends) are on the O(n) × O(n 2) grid, (O(n 2) × O(n 3) grid).
Visualizing Evolving Networks: Minimum Spanning Trees versus Pathfinder Networks
 IN IEEE SYMPOSIUM ON INFORMATION VISUALIZATION
, 2003
"... Network evolution is a ubiquitous phenomenon in a wide variety of complex systems. There is an increasing interest in statistically modeling the evolution of complex networks such as smallworld networks and scalefree networks. In this article, we address a practical issue concerning the visualizat ..."
Abstract

Cited by 36 (4 self)
 Add to MetaCart
Network evolution is a ubiquitous phenomenon in a wide variety of complex systems. There is an increasing interest in statistically modeling the evolution of complex networks such as smallworld networks and scalefree networks. In this article, we address a practical issue concerning the visualization of network evolution. We compare the visualizations of cocitation networks of scientific publications derived by two widely known link reduction algorithms, namely minimum spanning trees (MSTs) and Pathfinder networks (PFNETs). Our primarily goal is to identify the strengths and weaknesses of the two methods in fulfilling the need for visualizing evolving networks. Two criteria are derived for assessing visualizations of evolving networks in terms of topological properties and dynamical properties. We examine the animated visualization models of the evolution of botulinum toxin research in terms of its cocitation structure across a 58year span (19452002). The results suggest that although highdegree nodes dominate the structure of MST models, such structures can be inadequate in depicting the essence of how the network evolves because MST removes potentially significant links from highorder shortest paths. In contrast, PFNET models clearly demonstrate their superiority in maintaining the cohesiveness of some of the most pivotal paths, which in turn make the growth animation more predictable and interpretable. We suggest that the design of visualization and modeling tools for network evolution should take the cohesiveness of critical paths into account.
Visualizing Related Metabolic Pathways in Two and a Half Dimensions
, 2003
"... We propose a method for visualizing a set of related metabolic pathways using 2 2 D graph drawing. Interdependent, twodimensional layouts of each pathway are stacked on top of each other so that biologists get a full picture of subtle and significant di#erences among the pathways. Layouts are ..."
Abstract

Cited by 31 (7 self)
 Add to MetaCart
We propose a method for visualizing a set of related metabolic pathways using 2 2 D graph drawing. Interdependent, twodimensional layouts of each pathway are stacked on top of each other so that biologists get a full picture of subtle and significant di#erences among the pathways. Layouts are determined by a global layout of the union of all pathwayrepresenting graphs using a variant of the proven Sugiyama approach for layered graph drawing that allows edges to cross if they appear in di#erent graphs.
Exploring the Computing Literature Using Temporal Graph Visualization
 in Conference on Visualization and Data Analysis (VDA
, 2003
"... What are the hottest computer science research topics today? Which research areas are experiencing steady decline? How many coauthors are typical for a research paper today and 20 years ago? Who are the most prolific writers? In this paper, we attempt to address these questions as well as study col ..."
Abstract

Cited by 27 (4 self)
 Add to MetaCart
(Show Context)
What are the hottest computer science research topics today? Which research areas are experiencing steady decline? How many coauthors are typical for a research paper today and 20 years ago? Who are the most prolific writers? In this paper, we attempt to address these questions as well as study collaboration patterns, research communities, interactions between related research specialties, and the evolution of these characteristics through time. For our analysis we use data from the Association of Computing Machinery's Digital Library of Scientific Literature (ACM Portal) which contains over a hundred thousand research papers and authors. We use a novel technique for visualization of large graphs that evolve through time. Given a dynamic graph, the layout algorithm produces twodimensional representations of each timeslice, while preserving the mental map of the graph from one slice to the next. A combined view, with all the timeslices can also be viewed and explored. Graphs with tens of thousands of vertices and edges, resulting from specific queries to our local copy of the ACM database, are generated and displayed in seconds. The images in this paper are produced by a graph layout tool which uses the dynamic graph layout algorithm.
Simultaneous graph drawing: Layout algorithms and visualization schemes
 In 11th Symposium on Graph Drawing (GD
, 2003
"... Abstract. In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., graphs that share all, or parts of the same vertex set. We designed and implemented three different algorithms for simultaneous graphs drawing and three different visualization schemes. The al ..."
Abstract

Cited by 27 (7 self)
 Add to MetaCart
(Show Context)
Abstract. In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., graphs that share all, or parts of the same vertex set. We designed and implemented three different algorithms for simultaneous graphs drawing and three different visualization schemes. The algorithms are based on a modification of the forcedirected algorithm that allows us to take into account vertex weights and edge weights in order to achieve mental map preservation while obtaining individually readable drawings. The implementation is in Java and the system can be downloaded at
Parallel Edge Splatting for Scalable Dynamic Graph Visualization
, 2011
"... We present a novel dynamic graph visualization technique based on nodelink diagrams. The graphs are drawn sidebyside from left to right as a sequence of narrow stripes that are placed perpendicular to the horizontal time line. The hierarchically organized vertices of the graphs are arranged on v ..."
Abstract

Cited by 23 (6 self)
 Add to MetaCart
(Show Context)
We present a novel dynamic graph visualization technique based on nodelink diagrams. The graphs are drawn sidebyside from left to right as a sequence of narrow stripes that are placed perpendicular to the horizontal time line. The hierarchically organized vertices of the graphs are arranged on vertical, parallel lines that bound the stripes; directed edges connect these vertices from left to right. To address massive overplotting of edges in huge graphs, we employ a splatting approach that transforms the edges to a pixelbased scalar field. This field represents the edge densities in a scalable way and is depicted by nonlinear color mapping. The visualization method is complemented by interaction techniques that support data exploration by aggregation, filtering, brushing, and selective data zooming. Furthermore, we formalize graph patterns so that they can be interactively highlighted on demand. A case study on software releases explores the evolution of call graphs extracted from the JUnit open source software project. In a second application, we demonstrate the scalability of our approach by applying it to a bibliography dataset containing more than 1.5 million paper titles from 60 years of research history producing a vast amount of relations between title words.
Visualising changes in fund manager holdings in two and a half dimensions
 INFORMATION VISUALIZATION
, 2004
"... We explore a multipleview, or overview and detail, method for visualising a high dimensional portfolio holdings dataset with attributes that change over time. The method employs techniques from multidimensional scaling and graph visualisation to find a two dimensional mapping for high dimensional ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
We explore a multipleview, or overview and detail, method for visualising a high dimensional portfolio holdings dataset with attributes that change over time. The method employs techniques from multidimensional scaling and graph visualisation to find a two dimensional mapping for high dimensional data. In both the overview and detail views, time is mapped to the third dimension providing a two and a half dimensional view of changes in the data. We demonstrate the utility of the paradigm with a prototype system for visualisation of movements within a large set of UK fund managers’ stock portfolios.
An Argumentation Analysis of Weblog Conversations
 In The 9th International Working Conference on the LanguageAction Perspective on Communication Modelling (LAP
, 2004
"... Abstract 1 Weblogs are important new components of the Internet. They provide individual users with an easy way to publish online and others to comment on these views. Furthermore, there is a suite of secondary applications that allow weblogs to be linked, searched, and navigated. Although originall ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
(Show Context)
Abstract 1 Weblogs are important new components of the Internet. They provide individual users with an easy way to publish online and others to comment on these views. Furthermore, there is a suite of secondary applications that allow weblogs to be linked, searched, and navigated. Although originally intended for individual use, in practice weblogs increasingly appear to facilitate distributed conversations. This could have important implications for the use of this technology as a medium for collaboration. Given the special characteristics of weblogs and their supporting applications, they may be well suited for a range of conversational purposes that require different forms of argumentation. In this paper, we analyze the argumentation potential of weblog technologies, using a diagnostic framework for argumentation technologies. We pay special attention to the conversation structures and dynamics that weblogs naturally afford. Based on this initial analysis, we make a number of recommendations for research on how to apply these technologies in purposeful conversation processes such as for knowledge management. The copyright of this paper belongs to the paper’s authors. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage.
How important is the ”mental map”? — An empirical investigation of a dynamic graph layout algorithm
 Graph Drawing, volume 4372 of Lecture Notes in Computer Science
, 2006
"... Abstract. While some research has been performed on the human understanding of static graph layout algorithms, dynamic graph layout algorithms have only recently been developed sufficiently to enable similar investigations. This paper presents the first empirical analysis of a dynamic graph layou ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
(Show Context)
Abstract. While some research has been performed on the human understanding of static graph layout algorithms, dynamic graph layout algorithms have only recently been developed sufficiently to enable similar investigations. This paper presents the first empirical analysis of a dynamic graph layout algorithm, focusing on the assumption that maintaining the “mental map ” between timeslices assists with the comprehension of the evolving graph. The results confirm this assumption with respect to some categories of tasks. 1