pith. sign in

arxiv: 1204.5853 · v3 · pith:DYNHPFNJnew · submitted 2012-04-26 · 💻 cs.DS · cs.DM

Simultaneous Embedding of Planar Graphs

classification 💻 cs.DS cs.DM
keywords embeddinggraphssimultaneousworkbasisbeenconcerneddeal
0
0 comments X
read the original abstract

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 thus is an important field of research. Recently there has been a great deal of work investigating simultaneous embedding problems both from a theoretical and a practical point of view. We survey recent work on this topic.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.