Results 1  10
of
58
Graph visualization and navigation in information visualization: A survey
 IEEE Transactions on Visualization and Computer Graphics
"... ..."
A system for graphbased visualization of the evolution of software
 In Proceedings of the 2003 ACM symposium on Software visualization
, 2003
"... We describe Gevol, a system that visualizes the evolution of software using a novel graph drawing technique for visualization of large graphs with a temporal component. Gevol extracts information about a Java program stored within a CVS version control system and displays it using a temporal graph v ..."
Abstract

Cited by 89 (13 self)
 Add to MetaCart
(Show Context)
We describe Gevol, a system that visualizes the evolution of software using a novel graph drawing technique for visualization of large graphs with a temporal component. Gevol extracts information about a Java program stored within a CVS version control system and displays it using a temporal graph visualizer. This information can be used by programmers to understand the evolution of a legacy program: Why is the program structured the way it is? Which programmers were responsible for which parts of the program during which time periods? Which parts of the program appear unstable over long periods of time and may need to be rewritten? This type of information will complement that produced by more static tools such as source code browsers, slicers, and static analyzers. 1
Visual Unrolling of Network Evolution and the Analysis of Dynamic Discourse
, 2002
"... A new method for visualizing the class of incrementally evolving networks is presented. In addition to the intermediate states of the network it conveys the nature of the change between them by unrolling the dynamics of the network. Each modification is shown in a separate layer of a threedimension ..."
Abstract

Cited by 57 (6 self)
 Add to MetaCart
A new method for visualizing the class of incrementally evolving networks is presented. In addition to the intermediate states of the network it conveys the nature of the change between them by unrolling the dynamics of the network. Each modification is shown in a separate layer of a threedimensional representation, where the stack of layers corresponds to a time line of the evolution. We focus on discourse networks as the driving application, but our method extends to any type of network evolving in similar ways.
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 43 (9 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
Online Dynamic Graph Drawing
"... This paper presents an algorithm for drawing a sequence of graphs online. The algorithm strives to maintain the global structure of the graph and thus the user’s mental map, while allowing arbitrary modifications between consecutive layouts. The algorithm works online and uses various execution cu ..."
Abstract

Cited by 36 (1 self)
 Add to MetaCart
This paper presents an algorithm for drawing a sequence of graphs online. The algorithm strives to maintain the global structure of the graph and thus the user’s mental map, while allowing arbitrary modifications between consecutive layouts. The algorithm works online and uses various execution culling methods in order to reduce the layout time and handle large dynamic graphs. Techniques for representing graphs on the GPU allow a speedup by a factor of up to 17 compared to the CPU implementation. The scalability of the algorithm across GPU generations is demonstrated. Applications of the algorithm to the visualization of discussion threads in Internet sites and to the visualization of social networks are provided.
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 25 (6 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).
Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms
 Journal of Graph Algorithms and Applications
, 1998
"... Preserving the “mental map ” is a major goal of interactive graph drawing algorithms. Several models have been proposed for formalizing the notion of mental map. Additional work needs to be done to formulate and validate “difference ” metrics which can be used in practice. This paper introduces a fr ..."
Abstract

Cited by 24 (2 self)
 Add to MetaCart
(Show Context)
Preserving the “mental map ” is a major goal of interactive graph drawing algorithms. Several models have been proposed for formalizing the notion of mental map. Additional work needs to be done to formulate and validate “difference ” metrics which can be used in practice. This paper introduces a framework for defining and validating metrics to measure the difference between two drawings of the same graph, and gives a preliminary experimental analysis of several simple metrics.
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 22 (2 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 22 (6 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
Using Graph Layout to Visualize Train Interconnection Data
, 2000
"... We are concerned with the problem of visualizing interconnections in railroad systems. The realworld systems we have to deal with contain connections of thousands of trains. To visualize such a system from a given set of time tables a socalled train graph is used. It contains a vertex for each ..."
Abstract

Cited by 21 (4 self)
 Add to MetaCart
(Show Context)
We are concerned with the problem of visualizing interconnections in railroad systems. The realworld systems we have to deal with contain connections of thousands of trains. To visualize such a system from a given set of time tables a socalled train graph is used. It contains a vertex for each station met by any train, and one edge between every pair of vertices connected by some train running from one station to the other without halting in between.