4 search results - page 1 / 1 » Characterizing Simultaneous Embedding with Fixed Edges |
COMGEO
2011
ACM
13 years 1 months ago
2011
ACM
A set of planar graphs share a simultaneous embedding if they can be drawn on the same vertex set V in the Euclidean plane without crossings between edges of the same graph. Fixed ...
ENDM
2008
13 years 6 months ago
2008
GD
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
WADS
2009
Springer
14 years 25 days ago
2009
Springer
Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...