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

DOI10.1007/978-3-642-00219-9_16zbMath1213.68447OpenAlexW1488574305WikidataQ56977157 ScholiaQ56977157MaRDI QIDQ3611849

No author found.

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

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

Related Items (4)

Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph ⋮ Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree ⋮ Simultaneous Embeddings with Few Bends and Crossings ⋮ Disconnectivity and relative positions in simultaneous embeddings

Cites Work

• Unnamed Item
• How to draw a planar graph on a grid
• Simultaneous Graph Embeddings with Fixed Edges
• Planarity Testing and Optimal Edge Insertion with Embedding Constraints
• Embedding Graphs Simultaneously with Fixed Edges
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• Planar Graphs with Topological Constraints
• On-Line Planarity Testing
• Drawing database schemas
• Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
• Simultaneous Geometric Graph Embeddings
• Graph Drawing

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