Simultaneous Embeddings with Few Bends and Crossings
From MaRDI portal
Publication:5233141
DOI10.7155/jgaa.00507zbMath1419.05146OpenAlexW2973145124MaRDI QIDQ5233141
No author found.
Publication date: 16 September 2019
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00507
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (2)
Hanani--Tutte and Hierarchical Partial Planarity ⋮ Drawing Simultaneously Embedded Graphs with Few Bends
Cites Work
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
- Curve-constrained drawings of planar graphs
- On simultaneous planar graph embeddings
- Geometric drawings of \(K_{n}\) with few crossings
- Two trees which are self-intersecting when drawn simultaneously
- An algorithm for constructing star-shaped drawings of plane graphs
- Algorithms for plane representations of acyclic digraphs
- Graphs drawn with few crossings per edge
- 1-page and 2-page drawings with bounded number of crossings per edge
- Disconnectivity and relative positions in simultaneous embeddings
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends
- Drawing Simultaneously Embedded Graphs with Few Bends
- Simultaneous Embeddings with Few Bends and Crossings
- On a Tree and a Path with no Geometric Simultaneous Embedding
- Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes
- Constrained Simultaneous and Near-Simultaneous Embeddings
- SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES
- Embedding Graphs Simultaneously with Fixed Edges
- An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- Crossing-Free Subgraphs
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
- Simultaneous Embedding of Planar Graphs with Few Bends
- Simultaneous Geometric Graph Embeddings
- On the Number of Crossings in a Complete Graph
- Simultaneous Embedding with Two Bends per Edge in Polynomial Area
- Drawing Partially Embedded and Simultaneously Planar Graphs
- Embedding planar graphs at fixed vertex locations
This page was built for publication: Simultaneous Embeddings with Few Bends and Crossings
