A system for graph-based visualization of the evolution of software
Proceedings of the 2003 ACM symposium on Software visualization
On simultaneous planar graph embeddings
Computational Geometry: Theory and Applications
Embedding graphs simultaneously with fixed edges
GD'06 Proceedings of the 14th international conference on Graph drawing
Two trees which are self–intersecting when drawn simultaneously
GD'05 Proceedings of the 13th international conference on Graph Drawing
Simultaneous embedding of planar graphs with few bends
GD'04 Proceedings of the 12th international conference on Graph Drawing
Embeddability Problems for Upward Planar Digraphs
Graph Drawing
Matched Drawability of Graph Pairs and of Graph Triples
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Geometric simultaneous embeddings of a graph and a matching
GD'09 Proceedings of the 17th international conference on Graph Drawing
| Hi-index | 0.00 |
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 straight-line drawings Γ1 of G1 and Γ2 of G2, such that each vertex v2 = γ(v1) is mapped in Γ2 to the same point where v1 is mapped in Γ1, where v1 ∈ V1 and v2 ∈ V2. In this paper we examine several constrained versions and a relaxed version of the geometric simultaneous embedding problem. We show that if the input graphs are assumed to share no common edges this does not seem to yield large classes of graphs that can be simultaneously embedded. Further, if a prescribed combinatorial embedding for each input graph must be preserved, then we can answer some of the problems that are still open for geometric simultaneous embedding. Finally, we present some positive and negative results on the near-simultaneous embedding problem, in which vertices are not mapped exactly to the same but to "near" points in the different drawings.