Get an In-Depth Understanding of Graph Drawing Techniques, Algorithms, Software, and
Applications The Handbook of Graph Drawing and Visualization provides a broad, up-to …

Simultaneous embedding is concerned with simultaneously representing a series of graphs
sharing some or all vertices. This forms the basis for the visualization of dynamic graphs and …

In this article, we define and study the new problem of Simultaneous PQ-Ordering. Its input
consists of a set of PQ-trees, which represent sets of circular orders of their leaves, together …

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 extended to a planar drawing of the entire graph …

Two planar graphs G 1 and G 2 sharing some vertices and edges are simultaneously planar
if they have planar drawings such that a shared vertex [edge] is represented by the same …

Undirected graphs are frequently used to model phenomena that deal with interacting
objects, such as social networks, brain activity and communication networks. The topology of …

Abstract Two graphs G 1=(V, E 1) and G 2=(V, E 2) admit a geometric simultaneous
embedding if there exist a set of points P and a bijection M: V→ P that induce planar straight …

We investigate the problem of constructing planar drawings with few bends for two related
problems, the partially embedded graph problem-to extend a straight-line planar drawing of …

For two planar graphs G ①=(V ①, E ①) and G ②=(V ②, E ②) sharing a common subgraph
G= G ①∩ G ② the problem Simultaneous Embedding with Fixed Edges (SEFE) asks …

Abstract Two graphs G 1=(V, E 1) and G 2=(V, E 2) admit a geometric simultaneous
embedding if there exists a set of points P and a bijection M: P→ V that induce planar …