Pages that link to "Item:Q1386370"
From MaRDI portal
The following pages link to An algorithm for straight-line drawing of planar graphs (Q1386370):
Displaying 10 items.
- Graph layout for applications in compiler construction (Q1285776) (← links)
- \(\mathsf{T}\)-shape visibility representations of 1-planar graphs (Q1702255) (← links)
- Performing Multicut on Walkable Environments (Q2958325) (← links)
- Bitonic st-orderings for Upward Planar Graphs (Q2961518) (← links)
- Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints (Q3611859) (← links)
- Compact drawings of 1-planar graphs with right-angle crossings and few bends (Q5915941) (← links)
- Drawing graphs as spanners (Q5918794) (← links)
- Bitonic \(st\)-orderings for upward planar graphs: splits and bends in the variable embedding scenario (Q6053469) (← links)
- Transcript design problem of oritatami systems (Q6151174) (← links)
- Programmable single-stranded architectures for computing (Q6535757) (← links)
