Pages that link to "Item:Q3223962"
From MaRDI portal
The following pages link to Upper Bound Constructions for Untangling Planar Geometric Graphs (Q3223962):
Displaying 5 items.
- Untangling planar graphs from a specified vertex position-Hard cases (Q534342) (← links)
- Untangling polygons and graphs (Q848672) (← links)
- A polynomial bound for untangling geometric planar graphs (Q1042452) (← links)
- The Utility of Untangling (Q5892357) (← links)
- Untangling circular drawings: algorithms and complexity (Q6101838) (← links)