Pages that link to "Item:Q904086"
From MaRDI portal
The following pages link to Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs (Q904086):
Displaying 8 items.
- Area, curve complexity, and crossing resolution of non-planar graph drawings (Q649108) (← links)
- Construction of a topological drawing of the most planar subgraph of the non-planar graph (Q1792535) (← links)
- Planarity of streamed graphs (Q2333805) (← links)
- (Q3205253) (← links)
- Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area (Q4899278) (← links)
- Non-aligned Drawings of Planar Graphs (Q5367028) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711521) (← links)
- Hierarchical partial planarity (Q5915789) (← links)