Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Simultaneous embedding

In graph drawing and information visualization, simultaneous embedding is a technique for visualizing two or more different graphs on the same or… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
In this work we investigate the complexity of some problems related to the {\em Simultaneous Embedding with Fixed Edges} (SEFE… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Network Virtualization is claimed to be a key component of the Future Internet, providing the dynamic support of different… Expand
  • figure 1
  • figure 2
  • table I
  • figure 3
  • table II
Is this relevant?
2013
2013
A simultaneous embedding with fixed edges (SEFE) of a set of k planar graphs G1,…,Gk on the same set of vertices is a set of k… Expand
Is this relevant?
2011
2011
Given k planar graphs G1,…,Gk, deciding whether they admit a simultaneous embedding with fixed edges (Sefe ) and whether they… Expand
Is this relevant?
Highly Cited
2010
Highly Cited
2010
We study the following problem: Given a planar graph G and a planar drawing (embedding) of a subgraph of G, can such a drawing be… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2007
2007
Let G1 and G2 be two planar graphs having some vertices in common. A simultaneous embedding of G1 and G2 is a pair of crossing… Expand
Is this relevant?
2006
2006
We consider the problem of simultaneous embedding of planar graphs. We demonstrate how to simultaneously embed a path and an n… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2005
2005
We consider several variations of the simultaneous embedding problem for planar graphs. We begin with a simple proof that not all… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We present an O(n) time algorithm for simultaneous embedding of pairs of planar graphs on the O(n2)× O(n2) grid, with at most… Expand
Is this relevant?
2003
2003
We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?