57 search results - page 9 / 12 » Inapproximability for planar embedding problems |
GD
2007
Springer
15 years 3 months ago
2007
Springer
A geometric simultaneous embedding of two graphs G1 = (V1, E1) and G2 = (V2, E2) with a bijective mapping of their vertex sets γ : V1 → V2 is a pair of planar straightline drawi...
86
Voted
MOBIHOC
2005
ACM
15 years 9 months ago
2005
ACM
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
GD
2005
Springer
15 years 3 months 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...
ECCC
2010
14 years 6 months ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
CGF
2007
14 years 9 months ago
2007
We propose a mesh segmentation algorithm via recursive bisection where at each step, a sub-mesh embedded in 3D is first spectrally projected into the plane and then a contour is ...