Simultaneous Embedding
From MaRDI portal
Publication:5001665
DOI10.1007/978-981-15-6533-5_13OpenAlexW4233109367MaRDI QIDQ5001665
Publication date: 22 July 2021
Published in: Beyond Planar Graphs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-981-15-6533-5_13
Related Items (4)
Simple algorithms for partial and simultaneous rectangular duals with given contact orientations ⋮ Mutual witness Gabriel drawings of complete bipartite graphs ⋮ Mutual witness Gabriel drawings of complete bipartite graphs ⋮ Drawing Simultaneously Embedded Graphs with Few Bends
Cites Work
- Unnamed Item
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
- Clustered planarity testing revisited
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Cyclic ordering is NP-complete
- Clustered planarity = flat clustered planarity
- Simultaneous embedding: edge orderings, relative positions, cutvertices
- Inserting an edge into a planar graph
- On-line maintenance of triconnected components with SPQR-trees
- Beyond level planarity: cyclic, torus, and simultaneous level planarity
- Advancements on SEFE and partitioned book embedding problems
- Disconnectivity and relative positions in simultaneous embeddings
- Unified Hanani-Tutte theorem
- Clustered planarity with pipes
- Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends
- Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants
- Hanani–Tutte, Monotone Drawings, and Level-Planarity
- Drawing Simultaneously Embedded Graphs with Few Bends
- Simultaneous Embeddings with Few Bends and Crossings
- Hanani-Tutte for Radial Planarity II
- Beyond Level Planarity
- Simultaneous Orthogonal Planarity
- Intersection Graphs in Simultaneous Embedding with Fixed Edges
- Radial Level Planarity Testing and Embedding in Linear Time
- SIMULTANEOUS EMBEDDING OF EMBEDDED PLANAR GRAPHS
- Simultaneous Graph Embeddings with Fixed Edges
- Embedding Graphs Simultaneously with Fixed Edges
- Total Ordering Problem
- On the NP-hardness of GRacSim drawing and k-SEFE Problems
- Hierarchical planarity testing algorithms
- Geometric RAC Simultaneous Drawings of Graphs
- Testing Simultaneous Planarity when the Common Graph is 2-Connected
- Testing Planarity of Partially Embedded Graphs
- Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems
- Simultaneous Geometric Graph Embeddings
- Hanani-Tutte for Radial Planarity
- Drawing Partially Embedded and Simultaneously Planar Graphs
- Embedding planar graphs at fixed vertex locations
- Planarity for clustered graphs
This page was built for publication: Simultaneous Embedding
