Sciweavers

73 search results - page 3 / 15
» Graph drawing using quantum commute time
Sort
View
ACSC
2004
IEEE
13 years 11 months ago
Flexible Layering in Hierarchical Drawings with Nodes of Arbitrary Size
Graph drawing is an important area of information visualization which concerns itself with the visualization of relational data structures. Relational data like networks, hierarch...
Carsten Friedrich, Falk Schreiber
APVIS
2006
13 years 8 months ago
Mental map preserving graph drawing using simulated annealing
Information visualization has attracted much attention in recent years in many fields of science and engineering. In many applications, graphs are `dynamic' in the sense that...
Yi-Yi Lee, Chun-Cheng Lin, Hsu-Chun Yen
GD
2006
Springer
13 years 11 months ago
SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
Ali Civril, Malik Magdon-Ismail, Eli Bocek-Rivele
GD
1998
Springer
13 years 11 months ago
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
Christian A. Duncan, Michael T. Goodrich, Stephen ...
IV
2010
IEEE
193views Visualization» more  IV 2010»
13 years 5 months ago
Drawing Clustered Bipartite Graphs in Multi-circular Style
Abstract—Bipartite graphs are often used to illustrate relationships between two sets of data, such as web pages and visitors. At the same time, information is often organized hi...
Takao Ito, Kazuo Misue, Jiro Tanaka