Sciweavers

92 search results - page 2 / 19
» Applications of Parameterized st-Orientations in Graph Drawi...
Sort
View
JDA
2010
131views more  JDA 2010»
13 years 7 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
GD
2004
Springer
14 years 1 months ago
Dynamic Graph Drawing of Sequences of Orthogonal and Hierarchical Graphs
Abstract. In this paper we introduce two novel algorithms for drawing sequences of orthogonal and hierarchical graphs while preserving the mental map. Both algorithms can be parame...
Carsten Görg, Peter Birke, Mathias Pohl, Step...
DAGSTUHL
2007
13 years 10 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
ALGORITHMICA
2006
132views more  ALGORITHMICA 2006»
13 years 8 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...
VLC
2002
93views more  VLC 2002»
13 years 8 months ago
Metrics for Graph Drawing Aesthetics
Graph layout algorithms typically conform to one or more aesthetic criteria (e.g. minimising the number of bends, maximising orthogonality). Determining the extent to which a grap...
Helen C. Purchase