Sciweavers

9 search results - page 1 / 2
» Straightening Drawings of Clustered Hierarchical Graphs
Sort
View
SOFSEM
2007
Springer
13 years 10 months ago
Straightening Drawings of Clustered Hierarchical Graphs
In this paper we deal with making drawings of clustered hierarchical graphs nicer. Given a planar graph G = (V, E) with an assignment of the vertices to horizontal layers, a plane ...
Sergey Bereg, Markus Völker, Alexander Wolff,...
IV
2010
IEEE
193views Visualization» more  IV 2010»
13 years 3 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
ALGORITHMICA
2006
132views more  ALGORITHMICA 2006»
13 years 4 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...
JDA
2010
131views more  JDA 2010»
13 years 3 months ago
Convex drawings of hierarchical planar graphs and clustered planar graphs
: Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, soft...
Seok-Hee Hong, Hiroshi Nagamochi
JDA
2006
98views more  JDA 2006»
13 years 4 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