Enabling the user of a graph drawing system to preserve the mental map between two different layouts of a graph is a major problem. Whenever a layout in a graph drawing system is modified, the mental map of the user must be preserved. One way in which the user can be helped in understanding a change of layout is through animation of the change. In this paper, we present clustering-based strategies for identifying groups of nodes sharing a common, simple motion from initial layout to final layout. Transformation of these groups is then handled separately in order to generate a smooth animation
In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., gr...
Many different problems can be represented as graphs displayed in the form of node-link diagrams. Ho...
Many classical graph visualization algorithms have already been developed over the past decades. How...
Enabling the user of a graph drawing system to preserve the mental map between two different layouts...
Given a graph G and a drawing or layout of G, it is sometimes desirable to alter or adjust the layo...
In this technical report we introduce the concept of graph animations as a sequence of evolving grap...
This paper aims to empirically analyze the esthetics for user-sketched layouts of clustered graphs w...
Network visualisations use clustering approaches to simplify the presentation of complex graph struc...
This paper proposes a new technique for visualizing large graphs of several ten thousands of vertice...
In this paper, we present a new approach to exploring dynamic graphs. We have developed a new cluste...
Abstract. In this paper, we present a new approach to exploring dy-namic graphs. We have developed a...
National audienceGraphs are mathematical structures that provide natural means for complex-data r...
Visualizing graphs has been studied extensively in the community of graph drawing and information vi...
Graph clustering has applications in many areas such as hypermedia systems, web communities and grap...
Many classical graph visualization algorithms have already been developed over the past decades. How...
In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., gr...
Many different problems can be represented as graphs displayed in the form of node-link diagrams. Ho...
Many classical graph visualization algorithms have already been developed over the past decades. How...
Enabling the user of a graph drawing system to preserve the mental map between two different layouts...
Given a graph G and a drawing or layout of G, it is sometimes desirable to alter or adjust the layo...
In this technical report we introduce the concept of graph animations as a sequence of evolving grap...
This paper aims to empirically analyze the esthetics for user-sketched layouts of clustered graphs w...
Network visualisations use clustering approaches to simplify the presentation of complex graph struc...
This paper proposes a new technique for visualizing large graphs of several ten thousands of vertice...
In this paper, we present a new approach to exploring dynamic graphs. We have developed a new cluste...
Abstract. In this paper, we present a new approach to exploring dy-namic graphs. We have developed a...
National audienceGraphs are mathematical structures that provide natural means for complex-data r...
Visualizing graphs has been studied extensively in the community of graph drawing and information vi...
Graph clustering has applications in many areas such as hypermedia systems, web communities and grap...
Many classical graph visualization algorithms have already been developed over the past decades. How...
In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., gr...
Many different problems can be represented as graphs displayed in the form of node-link diagrams. Ho...
Many classical graph visualization algorithms have already been developed over the past decades. How...