Pages that link to "Item:Q1813977"
From MaRDI portal
The following pages link to Fixed edge-length graph drawing is NP-hard (Q1813977):
Displaying 16 items.
- A note on isosceles planar graph drawing (Q763540) (← links)
- The logic engine and the realization problem for nearest neighbor graphs (Q1349880) (← links)
- HV-planarity: algorithms and complexity (Q1628786) (← links)
- On the edge-length ratio of outerplanar graphs (Q1740698) (← links)
- Data-driven graph drawing techniques with applications for conveyor systems (Q1980856) (← links)
- Planar straight-line realizations of 2-trees with prescribed edge lengths (Q2151440) (← links)
- On the edge-length ratio of planar graphs (Q2206847) (← links)
- Free edge lengths in plane graphs (Q2354683) (← links)
- (Q2741352) (← links)
- On the Computational Complexity of Degenerate Unit Distance Representations of Graphs (Q3000515) (← links)
- An Experimental Study on Distance-Based Graph Drawing (Q3611854) (← links)
- On the Hardness of Orthogonal-Order Preserving Graph Drawing (Q3611858) (← links)
- On the Edge-Length Ratio of 2-Trees (Q5014107) (← links)
- On Edge-Length Ratios of Partial 2-Trees (Q5072225) (← links)
- Equilateral Spherical Drawings of Planar Cayley Graphs (Q5144883) (← links)
- Degree-constrained orientations of embedded graphs (Q5963649) (← links)
