Sciweavers

59 search results - page 2 / 12
» FADE: Graph Drawing, Clustering, and Visual Abstraction
Sort
View
SAC
2009
ACM
14 years 18 days ago
Visualization of clustered directed acyclic graphs with node interleaving
Graph drawing and visualization represent structural information ams of abstract graphs and networks. An important subset of graphs is directed acyclic graphs (DAGs). E-Spring alg...
Pushpa Kumar, Kang Zhang
IV
2009
IEEE
128views Visualization» more  IV 2009»
14 years 13 days ago
Large Quasi-Tree Drawing: A Neighborhood Based Approach
In this paper, we present an algorithm to lay out a particular class of graphs coming from real case studies: the quasi-tree graph class. Protein and internet mappings projects ha...
Romain Bourqui, David Auber
ALGORITHMICA
2006
132views more  ALGORITHMICA 2006»
13 years 5 months ago
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clus...
Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Na...
GD
2005
Springer
13 years 11 months ago
Drawing Clustered Graphs in Three Dimensions
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...
Joshua Wing Kei Ho, Seok-Hee Hong
JDA
2006
98views more  JDA 2006»
13 years 5 months ago
Completely connected clustered graphs
Abstract. Planar drawings of clustered graphs are considered. We introduce the notion of completely connected clustered graphs, i.e. hierarchically clustered graphs that have the p...
Sabine Cornelsen, Dorothea Wagner