Pages that link to "Item:Q2505225"
From MaRDI portal
The following pages link to A linear time algorithm for constructing maximally symmetric straight line drawings of triconnected planar graphs (Q2505225):
Displaying 7 items.
- Testing planarity of geometric automorphisms in linear time (Q1018045) (← links)
- Fast detection and display of symmetry in outerplanar graphs (Q1199463) (← links)
- Drawing series parallel digraphs symmetrically (Q1841117) (← links)
- Drawing planar graphs symmetrically. II: Biconnected planar graphs (Q2483999) (← links)
- Drawing planar graphs symmetrically. III: Oneconnected planar graphs (Q2492626) (← links)
- A linear-time algorithm for symmetric convex drawings of internally triconnected plane graphs (Q5961977) (← links)
- (Q6065397) (← links)