SIMULTANEOUS EMBEDDING OF EMBEDDED PLANAR GRAPHS
DOI10.1142/S0218195913600029zbMath1344.68093MaRDI QIDQ3459356
Fabrizio Frati, Giuseppe Di Battista, Patrizio Angelini
Publication date: 22 December 2015
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (3)
Cites Work
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
- Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges
- On simultaneous planar graph embeddings
- Upward drawings of triconnected digraphs.
- Two trees which are self-intersecting when drawn simultaneously
- Some provably hard crossing number problems
- Quasi-upward planarity
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- On a Tree and a Path with no Geometric Simultaneous Embedding
- Intersection Graphs in Simultaneous Embedding with Fixed Edges
- Crossing Number is NP-Complete
- Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes
- SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- On-Line Planarity Testing
- Simultaneous Embedding of Planar Graphs with Few Bends
- Planarity Testing and Optimal Edge Insertion with Embedding Constraints
This page was built for publication: SIMULTANEOUS EMBEDDING OF EMBEDDED PLANAR GRAPHS
