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

Related topics

Related topics

18 relations
Biconnected graphBook embeddingCaterpillar treeCrossing number (graph theory)
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
Testing planarity of partially embedded graphs
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
2009
2009
Intersection Graphs in Simultaneous Embedding with Fixed Edges
We examine the simultaneous embedding with xed edges problem for two planar graphs G1 and G2 with the focus on their intersection… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2007
Highly Cited
2007
On simultaneous planar graph embeddings
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
2006
2006
Simultaneous Graph Embeddings with Fixed Edges
We study the problem of simultaneously embedding several graphs on the same vertex set in such a way that edges common to two or… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2006
2006
Simultaneous Graph Embedding with Bends and Circular Arcs
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
2006
2006
Embedding Graphs Simultaneously with Fixed Edges
  • F. Frati
  • Graph Drawing
  • 2006
    • Corpus ID: 5690276
We show that a planar graph and a tree can always be simultaneously embedded with fixed edges and that two outerplanar graphs… Expand
  • figure 1
  • figure 2
  • figure 3
2005
2005
A note on simultaneous embedding of planar graphs
A tractor transmission includes a pair of dual power clutches that connects an engine to an input shaft through a gearset that… Expand
  • figure 2
  • figure 1
2004
2004
Simultaneous Embedding of Planar Graphs with Few Bends
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
2002
2002
On Simultaneous Graph Embedding
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
  • figure 3
  • figure 4
2001
2001
Blind detection of multiple audio watermarks
The paper presents the extension of an audio watermarking approach to the blind detection of multiple watermarks. The underlying… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE