Pages that link to "Item:Q1902892"
From MaRDI portal
The following pages link to Drawing graphs on rectangular grids (Q1902892):
Displaying 10 items.
- Bend-optimal orthogonal graph drawing in the general position model (Q390165) (← links)
- Non-planar square-orthogonal drawing with few-bend edges (Q744098) (← links)
- Algorithms for area-efficient orthogonal drawing (Q1384191) (← links)
- A better heuristic for orthogonal graph drawings (Q1384200) (← links)
- Three-dimensional orthogonal graph drawing algorithms (Q1570822) (← links)
- Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible (Q2196563) (← links)
- Optimal two-sided embeddings of complete binary trees in rectangular grids (Q2332034) (← links)
- Vertex Contact Graphs of Paths on a Grid (Q2945180) (← links)
- Square-Orthogonal Drawing with Few Bends per Edge (Q4925252) (← links)
- Orthogonal drawing of high degree graphs with small area and few bends (Q5096952) (← links)