Sciweavers

852 search results - page 3 / 171
» Using graph parsing for automatic graph drawing
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
GD
2005
Springer
14 years 25 days ago
Applications of Parameterized st-Orientations in Graph Drawing Algorithms
Abstract. Many graph drawing algorithms use st-numberings (st-orientations or bipolar orientations) as a first step. An st-numbering of a biconnected undirected graph defines a d...
Charalampos Papamanthou, Ioannis G. Tollis
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
IV
2002
IEEE
130views Visualization» more  IV 2002»
14 years 7 days ago
Spring Embedder Preprocessing for WWW Visualization
We present a preprocessor for the spring embedder graph drawing method and show its use in speeding up the automatic layout of three-dimensional visualizations of WWW sites. Sprin...
Paul Mutton, Peter Rodgers
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