Simultaneous embedding

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

Topic mentions per year

Topic mentions per year

1995-2017
024619952017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Ignaz Rutter Karlsruhe Institute of Technology 11. 
  • figure 11.1
  • table 11.1
  • figure 11.2
  • figure 11.3
  • figure 11.4
Is this relevant?
2013
2013
A simultaneous embedding (with fixed edges) of two graphs $$G^{\textcircled {1}}$$ G1 and $$G^{\textcircled {2}}$$ G2 with common… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
For two planar graphs G 1 = (V 1 , E 1 ) and G 2 = (V 2 , E 2 ) sharing a common subgraphG = G 1∩G 2 the problem Simultaneous… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… (More)
Is this relevant?
2008
2008
We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2007
2007
A geometric simultaneous embedding of two graphs G1 = (V1, E1) and G2 = (V2, E2) with a bijective mapping of their vertex sets… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
Let G1 and G2 be a pair of planar graphs such that V (G1) = V (G2) = V . A simultaneous embedding [6] Ψ = (Γ1,Γ2) of G1 and G2 is… (More)
  • figure 2
  • figure 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We consider several variations of the simultaneous embedding problem for planar graphs. We begin with a simple proof that not all… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2002
2002
We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?