Pages that link to "Item:Q5301377"
From MaRDI portal
The following pages link to Computing Radial Drawings on the Minimum Number of Circles (Q5301377):
Displaying 5 items.
- Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time (Q547303) (← links)
- Planar drawings with few slopes of Halin graphs and nested pseudotrees (Q832866) (← links)
- Radial drawings of graphs: geometric constraints and trade-offs (Q954965) (← links)
- A force-directed algorithm for drawing directed graphs symmetrically (Q1721190) (← links)
- Planar drawings with few slopes of Halin graphs and nested pseudotrees (Q6586655) (← links)
