An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges

DOI10.1007/978-3-642-00219-9_16MaRDI QIDQ3611849zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 3 March 2009

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00219-9_16

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Testing the simultaneous embeddability of two graphs whose intersection is a biconnected graph or a tree
• Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
• Disconnectivity and relative positions in simultaneous embeddings
• Disconnectivity and relative positions in simultaneous embeddings
• Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph

Cites work

• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
• Drawing database schemas
• Embedding Graphs Simultaneously with Fixed Edges
• Graph Drawing
• How to draw a planar graph on a grid
• scientific article; zbMATH DE number 1445279 (Why is no real title available?)
• On-Line Planarity Testing
• Planar Graphs with Topological Constraints
• Planarity Testing and Optimal Edge Insertion with Embedding Constraints
• Simultaneous Geometric Graph Embeddings
• Simultaneous Graph Embeddings with Fixed Edges

Cited in

(6)

• Disconnectivity and relative positions in simultaneous embeddings
• Testing the simultaneous embeddability of two graphs whose intersection is a biconnected graph or a tree
• scientific article; zbMATH DE number 2038697 (Why is no real title available?)
• Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
• Simultaneous embeddings with few bends and crossings
• Simultaneous PQ-ordering with applications to constrained embedding problems

This page was built for publication: An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611849)