Pages that link to "Item:Q5088985"
From MaRDI portal
The following pages link to Efficient Algorithms for Ortho-Radial Graph Drawing. (Q5088985):
Displaying 6 items.
- Algorithms for area-efficient orthogonal drawing (Q1384191) (← links)
- An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings (Q5014120) (← links)
- (Q5140737) (← links)
- Computing Radial Drawings on the Minimum Number of Circles (Q5301377) (← links)
- The DFS-heuristic for orthogonal graph drawing (Q5943316) (← links)
- Crossing edge minimization in radial outerplanar layered graphs using segment paths (Q6065215) (← links)