Sciweavers

73 search results - page 10 / 15
» Graph drawing using quantum commute time
Sort
View
DCG
2008
82views more  DCG 2008»
13 years 7 months ago
Schnyder Woods and Orthogonal Surfaces
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face counting approach have important applications in gra...
Stefan Felsner, Florian Zickfeld
CGF
2008
110views more  CGF 2008»
13 years 7 months ago
TimeRadarTrees: Visualizing Dynamic Compound Digraphs
The evolution of dependencies in information hierarchies can be modeled by sequences of compound digraphs with edge weights. In this paper we present a novel approach to visualize...
Michael Burch, Stephan Diehl
ASUNAM
2010
IEEE
13 years 9 months ago
Pixel-Oriented Visualization of Change in Social Networks
We propose a new approach to visualize social networks. Most common network visualizations rely on graph drawing. While without doubt useful, graphs suffer from limitations like cl...
Klaus Stein, Rene Wegener, Christoph Schlieder
DAGSTUHL
2007
13 years 8 months ago
Exact Elimination of Cycles in Graphs
One of the standard basic steps in drawing hierarchical graphs is to invert some arcs of the given graph to make the graph acyclic. We discuss exact and parameterized algorithms fo...
Daniel Raible, Henning Fernau
APVIS
2003
13 years 8 months ago
A Scalable Method for Visualising Changes in Portfolio Data
In this paper techniques from multidimensional scaling and graph drawing are coupled to provide an overview-and-detail style method for visualising a high dimensional dataset whos...
Tim Dwyer