Sciweavers

1633 search results - page 10 / 327
» Planar Map Graphs
Sort
View
COCOON
1999
Springer
13 years 12 months ago
Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
Xuemin Lin, Peter Eades
JGT
2007
85views more  JGT 2007»
13 years 7 months ago
On self duality of pathwidth in polyhedral graph embeddings
: Let G be a 3-connected planar graph and G∗ be its dual. We show that the pathwidth of G∗ is at most 6 times the pathwidth of G. We prove this result by relating the pathwidth...
Fedor V. Fomin, Dimitrios M. Thilikos
SIAMDM
2000
59views more  SIAMDM 2000»
13 years 7 months ago
Nonhamiltonian 3-Connected Cubic Planar Graphs
We establish that every cyclically 4-connected cubic planar graph of order at most 40 is hamiltonian. Furthermore, this bound is determined to be sharp and we present all nonhamil...
Robert E. L. Aldred, S. Bau, Derek A. Holton, Bren...
SIGAL
1990
216views Algorithms» more  SIGAL 1990»
13 years 11 months ago
Planar Separators and the Euclidean Norm
In this paper we show that every 2-connected embedded planar graph with faces of sizes
Hillel Gazit, Gary L. Miller
WADS
2001
Springer
143views Algorithms» more  WADS 2001»
14 years 2 days 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