Simultaneous embedding of planar graphs with few bends
From MaRDI portal
Recommendations
Cited in
(21)- Two trees which are self-intersecting when drawn simultaneously
- Simultaneous embedding of a planar graph and its dual on the grid
- On embedding a graph in the grid with the maximum number of bends and other bad features
- Drawing simultaneously embedded graphs with few bends
- Simultaneous embeddings with few bends and crossings
- Simultaneous Graph Embedding with Bends and Circular Arcs
- An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
- Simultaneous embedding of a planar graph and its dual on the grid
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
- Simultaneous embeddings with few bends and crossings
- Simultaneous Embedding of Planar Graphs with Few Bends
- Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
- Constrained Simultaneous and Near-Simultaneous Embeddings
- Simultaneous Embedding with Two Bends per Edge in Polynomial Area
- Algorithms and Data Structures
- An exponential bound for simultaneous embeddings of planar graphs
- Drawing Simultaneously Embedded Graphs with Few Bends
- An annotated review on graph drawing and its applications
- On simultaneous straight-line grid embedding of a planar graph and its dual
- On simultaneous planar graph embeddings
- Simultaneous graph embedding with bends and circular arcs
This page was built for publication: Simultaneous embedding of planar graphs with few bends
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5711605)