140 search results - page 18 / 28 » On simultaneous planar graph embeddings |
GD
2005
Springer
14 years 7 days ago
2005
Springer
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...
CAGD
2006
13 years 6 months ago
2006
We describe how some simple properties of discrete one-forms directly relate to some old and new results concerning the parameterization of 3D mesh data. Our first result is an ea...
CLA
2004
13 years 8 months ago
2004
In Formal Concept Analysis, it is a very important but quite difficult task to draw line diagrams of concept lattices automatically. In particular, we want every planar lattice to ...
COMGEO
2012
ACM
12 years 2 months ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
JGT
2007
13 years 6 months ago
2007
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...