REVIEW 2 cited by
Simultaneous Embedding of Planar Graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
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.
Forward citations
Cited by 2 Pith papers
-
Monotone Clustered Level Planarity
mCLP is NP-complete even on constant-size-tree forests with bounded levels or clusters, and FPT when parameterized by vertex cover number plus number of clusters.
-
Simultaneous Representation of Proper and Unit Interval Graphs
Simultaneous proper interval graphs can be recognized in linear time and simultaneous unit interval graphs in O(|V||E|) time in the sunflower case, and both become NP-complete without the sunflower restriction.
Discussion (0). Continue with ORCID to comment.