Pages that link to "Item:Q5301009"
From MaRDI portal
The following pages link to A Polynomial Bound for Untangling Geometric Planar Graphs (Q5301009):
Displaying 5 items.
- Untangling planar graphs from a specified vertex position-Hard cases (Q534342) (← links)
- On the obfuscation complexity of planar graphs (Q924163) (← links)
- Untangling a planar graph (Q1042455) (← links)
- Upper Bound Constructions for Untangling Planar Geometric Graphs (Q3223962) (← links)
- Untangling polygons and graphs (Q5301008) (← links)