Sciweavers

90 search results - page 2 / 18
» Obfuscated Drawings of Planar Graphs
Sort
View
ALGORITHMICA
2006
132views more  ALGORITHMICA 2006»
13 years 11 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
2007
Springer
14 years 5 months ago
Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this ...
Hazel Everett, Sylvain Lazard, Giuseppe Liotta, St...
DCG
2010
135views more  DCG 2010»
13 years 11 months ago
Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this...
Hazel Everett, Sylvain Lazard, Giuseppe Liotta, St...
ESA
2000
Springer
122views Algorithms» more  ESA 2000»
14 years 2 months ago
Minimum Depth Graph Embedding
Abstract. The depth of a planar embedding is a measure of the topological nesting of the biconnected components of the graph. Minimizing the depth of planar embeddings has importan...
Maurizio Pizzonia, Roberto Tamassia
WADS
2001
Springer
143views Algorithms» more  WADS 2001»
14 years 3 months ago
An Approach for Mixed Upward Planarization
In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization...
Markus Eiglsperger, Michael Kaufmann